Mesh-based Nelder-Mead algorithm for inequality constrained optimization
From MaRDI portal
Publication:1616932
DOI10.1007/s10589-018-0016-0zbMath1409.90181OpenAlexW2768763745WikidataQ129725948 ScholiaQ129725948MaRDI QIDQ1616932
Charles Audet, Christophe Tribes
Publication date: 7 November 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0016-0
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
A discussion on variational analysis in derivative-free optimization, Binary, unrelaxable and hidden constraints in blackbox optimization, Two decades of blackbox optimization applications, A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, Calibration of parameters in dynamic energy budget models using direct-search methods, A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging, DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization, Dynamic improvements of static surrogates in direct search optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- NOMAD
- A literature survey of benchmark functions for global optimisation problems
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- A convergent variant of the Nelder--Mead algorithm
- Grid restrained Nelder-Mead algorithm
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Test examples for nonlinear programming codes
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search
- Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Sequential approximate optimization using radial basis function network for engineering optimization
- Algorithm 909
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Optimization and nonsmooth analysis
- Testing Unconstrained Optimization Software
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Derivative-Free and Blackbox Optimization
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- On the Global Convergence of a Filter--SQP Algorithm
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Fortified-Descent Simplicial Search Method: A General Approach
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- CUTEr and SifDec
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Frame based methods for unconstrained optimization
- Nonlinear programming without a penalty function.
