Article ID: | iaor19931512 |
Country: | Netherlands |
Volume: | 57 |
Issue: | 2 |
Start Page Number: | 313 |
End Page Number: | 324 |
Publication Date: | Nov 1992 |
Journal: | Mathematical Programming |
Authors: | Wasilkowski G.W. |
Keywords: | computational analysis, programming: nonlinear |
The average case complexity of global optimization problems is discussed. The average complexity roughly means the amount of work needed to solve the problem with the expected error not exceeding a preassigned error demand. The expectation is taken with respect to a probability measure on a class