Objective-derivative-free methods for constrained optimization

Mathematical Programming, Series B

Volumn 92, Issue 1, 2002, Pages 37-59

  Lucidi, S ^a   Sciandrone, M ^b   Tseng, P ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Constrained optimization; Derivative free method; Feasible descent; Metric regularity; MFCQ; Stationary point

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; ITERATIVE METHODS; OPTIMIZATION;

CONSTRAINED OPTIMIZATION; DERIVATIVE FREE METHOD; FEASIBLE DESCENT; METRIC REGULARITY; STATIONARY POINT;

COMPUTATIONAL METHODS;

EID: 0242598302     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100266     Document Type: Article

References (19)

1. Bauschke, H.H., Borwein, J.M., Li, W. (1999): Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization. Math. Program. 86, 135-160
2. Bertsekas, D.P. (1999): Nonlinear Programming, 2nd edn. Athena Scientific, Belmont
3. Bertsekas, D.P. (1999): A note on error bounds for convex and nonconvex programs. Computational Optimization and Applications 12, 41-51
4. Brent, R.P. (1973): Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs
5. Conn, A.R., Scheinberg, K., Toint, Ph.L. (1997): Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79, 397-415
6. Conn, A.R., Scheinberg, K., Toint, Ph.L. (1998): A derivative free optimization algorithm in practice. Proceedings of 7th AIAA/USAF/NASA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, St. Louis
7. Elster, C., Neumaier, A. (1995): A grid algorithm for bound constrained optimization of noisy functions. IMA Journal of Numerical Analysis 15, 585-608
8. Hock, W., Schittkowski, K. (1981): Test Examples for Nonlinear Programming Codes. Springer, Berlin
9. Schittkowski, K. (1987): More Test Examples for Nonlinear Programming Codes. Springer, Berlin
10. Lewis, R.M., Torczon, V. (1999): Pattern search methods for bound constrained minimization. SIAM Journal on Optimization 9, 1082-1099
11. Lewis, R.M., Torczon, V. (2000): Pattern search methods for linearly constrained minimization. SIAM Journal on Optimization 10, 917-941
12. Lucidi, S., Sciandrone, M. (1996): On the global convergence of derivative free methods for unconstrained optimization. Tech. Rep. 32-96, Dipartimento di Informatica e Sistemistica, Universitd di Roma "La Sapienza", Rome
13. Lucidi, S., Sciandrone, M. (1999): A derivative-free algorithm for bound constrained optimization. Tech. Rep. R. 498, Istituto di Analisi dei Sistemi ed Informatica - CNR, Rome, February 1999 (to appear in Computational Optimization and Applications)
14. Luo, Z.-Q., Tseng, P. (1994): Perturbation analysis of a condition number for linear systems. SIAM Journal on Matrix Analysis and Applications 15, 636-660
15. May, J.H. (1974): Linearly constrained nonlinear programming: a solution method that does not require analytic derivatives. Ph.D. thesis, Yale University, December 1974
16. Powell, M.J.D. (1998): Direct search algorithms for optimization calculations. Acta Numerica 7, 287-336
17. Robinson, S.M. (1976): Stability theory for systems of inequalities, Part II: Differentiable nonlinear systems. SIAM Journal of Numerical Analysis 13, 497-513
18. Rockafellar, R.T., Wets, R.J.-B. (1998): Variational Analysis. Springer, New York
19. Wright, M.H. (1995): Direct search methods: once scorned, now respectable. In: Griffiths, D.F., Watson, G.A., eds., Numerical Analysis 1995 (Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis), pp. 191-208. Addison-Wesley Longman, Harlow