A generating set direct search augmented Lagrangian algorithm for optimization with a combination of general and linear constraints

We consider the solution of nonlinear programs in the case where derivatives of the objective function and nonlinear constraints are unavailable. To solve such problems, we propose an adaptation of a method due to Conn, Gould, Sartenaer, and Toint that proceeds by approximately minimizing a succession of linearly constrained augmented Lagrangians. Our modification is to use a 3 derivative-free generating set direct search algorithm to solve the linearly constrained subproblems. The stopping criterion proposed by Conn, Gould, Sartenaer and Toint for the approximate solution of the subproblems requires explicit knowledge of derivatives. Such information is presumed absent in the generating set search method we employ. Instead, we show that stationarity results for linearly constrained generating set search methods provide a derivative-free stopping criterion, based on a step-length control parameter, that is sufficient to preserve the convergence properties of the original augmented Lagrangian algorithm.

[1]  M. Powell A method for nonlinear constraints in minimization problems , 1969 .

[2]  N. S. Barnett,et al.  Private communication , 1969 .

[3]  M. Hestenes Multiplier and gradient methods , 1969 .

[4]  Mordecai Avriel,et al.  Nonlinear programming , 1976 .

[5]  R. Tapia Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

[6]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[7]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[8]  Nicholas I. M. Gould,et al.  Global Convergence of two Augmented Lagrangian Algorithms for Optimization with a Combination of Gen , 1993 .

[9]  P. Toint,et al.  Local Convergence Properties of two Augmented Lagrangian Algorithms for Optimization with a Combinat , 1993 .

[10]  Nicholas I. M. Gould,et al.  Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints , 1996, SIAM J. Optim..

[11]  Robert Michael Lewis,et al.  A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds , 2002, SIAM J. Optim..

[12]  Paul Tseng,et al.  Objective-derivative-free methods for constrained optimization , 2002, Math. Program..

[13]  Tamara G. Kolda,et al.  Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods , 2003, SIAM Rev..

[14]  Tamara G. Kolda,et al.  Stationarity Results for Generating Set Search for Linearly Constrained Optimization , 2006, SIAM J. Optim..

[15]  Robert Michael Lewis,et al.  Implementing Generating Set Search Methods for Linearly Constrained Minimization , 2007, SIAM J. Sci. Comput..

[16]  Victor R. Preedy,et al.  Analysis and Methods , 2008 .

[17]  Tamara G. Kolda,et al.  Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization , 2008, SIAM J. Sci. Comput..