Convergence of Mesh Adaptive Direct Search to Second-Order Stationary Points

A previous analysis of second-order behavior of generalized pattern search algorithms for unconstrained and linearly constrained minimization is extended to the more general class of mesh adaptive direct search (MADS) algorithms for general constrained optimization. Because of the ability of MADS to generate an asymptotically dense set of search directions, we are able to establish reasonable conditions under which a subsequence of MADS iterates converges to a limit point satisfying second-order necessary or sufficient optimality conditions for general set-constrained optimization problems.

[1]  Charles Audet,et al.  Generalized pattern searches with derivative information , 2002, Math. Program..

[2]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[3]  C. J. Price,et al.  On the Convergence of Grid-Based Methods for Unconstrained Optimization , 2000, SIAM J. Optim..

[4]  A. J. Booker,et al.  A rigorous framework for optimization of expensive functions by surrogates , 1998 .

[5]  Charles Audet,et al.  Mesh Adaptive Direct Search Algorithms for Constrained Optimization , 2006, SIAM J. Optim..

[6]  Chandler Davis.  THEORY OF POSITIVE LINEAR DEPENDENCE. , 1954 .

[7]  Charles Audet,et al.  Finding Optimal Algorithmic Parameters Using the Mesh Adaptive Direct Search Algorithm , 2004 .

[8]  CHARLES AUDET,et al.  Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization , 2006, SIAM J. Optim..

[9]  Mark A. Abramson,et al.  Second-Order Behavior of Pattern Search , 2005, SIAM J. Optim..

[10]  Roberto Cominetti,et al.  A generalized second-order derivative in nonsmooth optimization , 1990 .

[11]  Charles Audet,et al.  A Pattern Search Filter Method for Nonlinear Programming without Derivatives , 2001, SIAM J. Optim..

[12]  J. Hiriart-Urruty,et al.  Generalized Hessian matrix and second-order optimality conditions for problems withC1,1 data , 1984 .

[13]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[14]  D. Finkel,et al.  Convergence analysis of the direct algorithm , 2004 .

[15]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[16]  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..

[17]  Virginia Torczon,et al.  On the Convergence of Pattern Search Algorithms , 1997, SIAM J. Optim..

[18]  I. Coope,et al.  Frame Based Methods for Unconstrained Optimization , 2000 .

[19]  R. Rockafellar.  Generalized Directional Derivatives and Subgradients of Nonconvex Functions , 1980, Canadian Journal of Mathematics.

[20]  J. Jahn.  Introduction to the Theory of Nonlinear Optimization , 1994 .

[21]  Charles Audet,et al.  Analysis of Generalized Pattern Searches , 2000, SIAM J. Optim..