A convergent variant of the Nelder--Mead algorithm
From MaRDI portal
Publication:700697
DOI10.1023/A:1014849028575zbMATH Open1172.90508OpenAlexW2031316504MaRDI QIDQ700697FDOQ700697
Recommendations
Cites work
- scientific article; zbMATH DE number 3889289 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- A Simplex Method for Function Minimization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Direct Search Methods on Parallel Machines
- Frame based methods for unconstrained optimization
- On the convergence of grid-based methods for unconstrained optimization
- Testing Unconstrained Optimization Software
- Theory of Positive Linear Dependence
Cited in
(39)
- A real-time optimization algorithm for the fixed-stress splitting scheme
- CNM -- a convergent method of Nelder and Mead type.
- An inexact modified subgradient algorithm for nonconvex optimization
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. I: Theoretical analysis
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. II: Numerical analysis
- A hyperbolic variant of the Nelder-Mead simplex method in low dimensions
- Survey of derivative-free optimization
- An adaptive search algorithm for numerical optimization
- A restarted and modified simplex search for unconstrained optimization
- Maximising output from oil reservoirs without water breakthrough
- A parameter estimation method based on random slow manifolds
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Optimization over the efficient set of multi-objective convex optimal control problems
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Multi-direction-based Nelder-Mead method
- Grid-based methods for linearly equality constrained optimization problems
- Efficient Implementation of the Nelder-Mead Search Algorithm
- Efficient calculation of regular simplex gradients
- Effect of dimensionality on the Nelder–Mead simplex method
- Unconstrained derivative-free optimization by successive approximation
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Frame-based ray search algorithms in unconstrained optimization
- Calibration of parameters in dynamic energy budget models using direct-search methods
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Parameter sensitivity study of the Nelder-Mead simplex method
- A modified Nelder-Mead barrier method for constrained optimization
- Less is more: simplified Nelder-Mead method for large unconstrained optimization
- Title not available (Why is no real title available?)
- A derivative-free algorithm for spherically constrained optimization
- A simplex-based numerical framework for simple and efficient robust design optimization
- Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- Optimal combination of aircraft maintenance tasks by a novel simplex optimization method
- Grid restrained Nelder-Mead algorithm
- Bayesian estimation of a multivariate TAR model when the noise process follows a Student-t distribution
- Convergent simplex searches and the ‘gloveless DataGlove’
- Derivative-free optimization methods
This page was built for publication: A convergent variant of the Nelder--Mead algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700697)
