A subclass of generating set search with convergence to second-order stationary points
From MaRDI portal
Publication:2926059
DOI10.1080/10556788.2013.808198zbMath1298.90101OpenAlexW2066494975MaRDI QIDQ2926059
Mark A. Abramson, Lennart Frimannslund, Trond Steihaug
Publication date: 29 October 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.808198
convergence analysissecond-order optimality conditionsderivative-free optimizationgenerating set searchdirectional direct search
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization, Mesh adaptive direct search with second directional derivative-based Hessian update, Generating set search using simplex gradients for bound-constrained black-box optimization, A second-order globally convergent direct-search method and its worst-case complexity, Derivative-free optimization methods
Uses Software
Cites Work
- Analysis of direct searches for discontinuous functions
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Incorporating minimum Frobenius norm models in direct search
- Generalized descent for global optimization
- Generalized pattern searches with derivative information
- A generating set search method using curvature information
- Geometry of interpolation sets in derivative free optimization
- On the Convergence of Pattern Search Algorithms
- Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Optimization and nonsmooth analysis
- Analysis of Generalized Pattern Searches
- Pattern Search Methods for Linearly Constrained Minimization
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Second-Order Behavior of Pattern Search
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Convergence Conditions for Ascent Methods. II: Some Corrections
- A Simplex Method for Function Minimization
