Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
From MaRDI portal
Recommendations
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder-Mead method
- Convergence theorems for the Nelder-Mead method
- On the convergence of nonstationary Newton methods
- A convergent variant of the Nelder--Mead algorithm
- On the convergence of Newton iterations to non-stationary points
- Necessary and sufficient convergence conditions for a class of nonlinear programming methods
- A Convergence Theory for a Class of Nonlinear Programming Problems
- Convergence of nonlinear conjugate gradient methods
Cited in
(63)- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Direct search methods: Then and now
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Optimal combination of aircraft maintenance tasks by a novel simplex optimization method
- Calibration of parameters in dynamic energy budget models using direct-search methods
- Inverse analysis of an internal reforming solid oxide fuel cell system using simplex search method
- Combining cross-entropy and MADS methods for inequality constrained global optimization
- Parallel two-phase methods for global optimization on GPU
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- A modified Nelder-Mead barrier method for constrained optimization
- Uniform simplex of an arbitrary orientation
- Optimization of a finite-difference scheme for numerical solution of the Helmholtz equation
- Solving large-scale optimization problems related to Bell's theorem
- An inexact modified subgradient algorithm for nonconvex optimization
- The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization
- A derivative-free descent method in set optimization
- Improved parallel chaos optimization algorithm
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Some approximations of the logistic distribution with application to the covariance matrix of logistic regression
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Convergence of the Nelder-Mead method
- An efficient hybrid algorithm for the optimization of problems with several local minima
- Stationarity and convergence in reduce-or-retreat minimization.
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Inverse analysis of conductive-convective wet triangular fin for predicting thermal properties and fin dimensions
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- Effect of dimensionality on the Nelder–Mead simplex method
- An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems
- A characterization of the Fermat point in Hilbert spaces
- A hyperbolic variant of the Nelder-Mead simplex method in low dimensions
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Hull-volume with applications to convergence analysis
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- Maximising output from oil reservoirs without water breakthrough
- scientific article; zbMATH DE number 2078361 (Why is no real title available?)
- The mesh adaptive direct search algorithm for granular and discrete variables
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem
- Less is more: simplified Nelder-Mead method for large unconstrained optimization
- Rational Spectral Filters with Optimal Convergence Rate
- A three-level parallelisation scheme and application to the Nelder-Mead algorithm
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- Inference of the two-parameter Lindley distribution based on progressive type II censored data with random removals
- Black-Box Optimization: Methods and Applications
- Derivative-free optimization methods
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Multi-direction-based Nelder-Mead method
- Convergence theorems for the Nelder-Mead method
- A simplex search method for a conductive-convective fin with variable conductivity
- An expectation conditional maximization Algorithm for the Skew-normal based stochastic frontier model
- Adaptive state-dependent diffusion for derivative-free optimization
- Analyzing basins of attraction in numerical minimization
- An improved adaptive quantum genetic algorithm as classical optimizer for the quantum approximate optimization algorithm on MaxCut problem
- A convergent variant of the Nelder--Mead algorithm
- Robust and parametric basins of attraction for inexact iteration mappings in numerical minimization
- On the optimal parameter values of the Nelder-Mead simplex algorithm
- Survey of derivative-free optimization
- A restarted and modified simplex search for unconstrained optimization
- Grid restrained Nelder-Mead algorithm
- Unconstrained derivative-free optimization by successive approximation
This page was built for publication: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229476)
