Optimization Online


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

M.A. Diniz-Ehrhardt (cheti***at***ime.unicamp.br)
J.M. Martínez (martinez***at***ime.unicamp.br)
L.G. Pedroso (lucasgp***at***ime.unicamp.br)

Abstract: 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.

Keywords: Nonlinear programming, Augmented Lagrangian, global convergence, optimality conditions, derivative-free optimization, constraint qualifications.

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )


Download: [PDF]

Entry Submitted: 06/23/2010
Entry Accepted: 06/23/2010
Entry Last Modified: 06/23/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society