Derivative-free methods for nonlinear programming with general lower-level constraints

Augmented Lagrangian methods for derivative-free continuous optimization with constraints are introduced in this paper. The algorithms inherit the convergence results obtained by Andreani, Birgin, Martínez and Schuverdt for the case in which analytic derivatives exist and are available. In particular, feasible limit points satisfy KKT conditions under the Constant Positive Linear Dependence (CPLD) constraint qualification. The form of our main algorithm allows us to employ well established derivative-free subalgorithms for solving lower-level constrained subproblems. Numerical experiments are presented.

Bibliographic Details

Main Authors:	Diniz-Ehrhardt,M. A., Martínez,J. M., Pedroso,L. G.
Format:	Digital revista
Language:	English
Published:	Sociedade Brasileira de Matemática Aplicada e Computacional 2011
Online Access:	http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000100003
Tags:	Add Tag No Tags, Be the first to tag this record!