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

DOI10.1137/050638382zbMath1174.90877OpenAlexW2034769744MaRDI QIDQ3440224

Mark A. Abramson, Charles Audet

Publication date: 22 May 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050638382

zbMATH Keywords

convergence analysisnonlinear programmingsecond-order optimality conditionsderivative-free optimizationmesh adaptive direct search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (34)

Using a derivative-free optimization method for multiple solutions of inverse transport problems ⋮ Integration of expert knowledge into radial basis function surrogate models ⋮ Survey of derivative-free optimization ⋮ Spent potliner treatment process optimization using a MADS algorithm ⋮ Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Bilevel direct search method for leader-follower problems and application in health insurance ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ A quasi-multistart framework for global optimization of expensive functions using response surface models ⋮ A subclass of generating set search with convergence to second-order stationary points ⋮ A Krylov-Arnoldi reduced order modelling framework for efficient, fully coupled, structural-acoustic optimization ⋮ An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions ⋮ Equal angle distribution of polling directions in direct-search methods ⋮ Mesh adaptive direct search with second directional derivative-based Hessian update ⋮ Analysis of direct searches for discontinuous functions ⋮ Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions ⋮ A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ Nonasymptotic densities for shape reconstruction ⋮ The UnreliableM/M/1 Retrial Queue in a Random Environment ⋮ A variance-based method to rank input variables of the mesh adaptive direct search algorithm ⋮ Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search ⋮ Decomposition in derivative-free optimization ⋮ Optimization of algorithms with OPAL ⋮ Direct search algorithm for bilevel programming problems ⋮ An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization ⋮ Generating set search using simplex gradients for bound-constrained black-box optimization ⋮ Mesh adaptive direct search with simplicial Hessian update ⋮ Mesh adaptive direct search algorithms for mixed variable optimization ⋮ A second-order globally convergent direct-search method and its worst-case complexity ⋮ SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications ⋮ Derivative-free optimization methods

This page was built for publication: Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points