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

AUTOR(ES)

Diniz-Ehrhardt, M. A., Martínez, J. M., Pedroso, L. G.

FONTE

Comput. Appl. Math.

DATA DE PUBLICAÇÃO

2011

RESUMO

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.

Documentos Relacionados

• Derivative-free nonlinear programming
• Metodos derivative-free para resolver um problema de programação não linear com restrições lineares
• Two derivative-free methods for solving underdetermined nonlinear systems of equations
• Hybrid derivative-free methods for nonlinear systems
• Otimização sem derivadas em conjuntos magros