A modified Nelder-Mead barrier method for constrained optimization
From MaRDI portal
Publication:2062438
DOI10.3934/naco.2020058zbMath1476.65102OpenAlexW3111481158MaRDI QIDQ2062438
Publication date: 27 December 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020058
Cites Work
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- A convergent variant of the Nelder--Mead algorithm
- Test examples for nonlinear programming codes
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
- On the Convergence of Pattern Search Algorithms
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- 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
- Analysis of Generalized Pattern Searches
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Fortified-Descent Simplicial Search Method: A General Approach
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Theory of Positive Linear Dependence
- Frame based methods for unconstrained optimization
- Positive bases in numerical optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A modified Nelder-Mead barrier method for constrained optimization
