Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
From MaRDI portal
Publication:4229476
DOI10.1137/S1052623496303482zbMath0962.65049WikidataQ60016550 ScholiaQ60016550MaRDI QIDQ4229476
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (51)
Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Survey of derivative-free optimization ⋮ A restarted and modified simplex search for unconstrained optimization ⋮ Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points ⋮ Grid restrained Nelder-Mead algorithm ⋮ Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ A characterization of the Fermat point in Hilbert spaces ⋮ Optimal combination of aircraft maintenance tasks by a novel simplex optimization method ⋮ Inference of the two-parameter Lindley distribution based on progressive type II censored data with random removals ⋮ An efficient hybrid algorithm for the optimization of problems with several local minima ⋮ Convergence of the Nelder-Mead method ⋮ Inverse analysis of conductive-convective wet triangular fin for predicting thermal properties and fin dimensions ⋮ A hyperbolic variant of the Nelder-Mead simplex method in low dimensions ⋮ An efficient hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) for solving nonlinear inverse parabolic problems ⋮ Uniform simplex of an arbitrary orientation ⋮ Implementing the Nelder-Mead simplex algorithm with adaptive parameters ⋮ Hull-volume with applications to convergence analysis ⋮ Optimization of a finite-difference scheme for numerical solution of the Helmholtz equation ⋮ An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives ⋮ A simplex search method for a conductive-convective fin with variable conductivity ⋮ Experimental complexity analysis of continuous constraint satisfaction problems. ⋮ Some approximations of the logistic distribution with application to the covariance matrix of logistic regression ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem ⋮ Combining cross-entropy and MADS methods for inequality constrained global optimization ⋮ Calibration of parameters in dynamic energy budget models using direct-search methods ⋮ Black-Box Optimization: Methods and Applications ⋮ Unconstrained derivative-free optimization by successive approximation ⋮ Parallel two-phase methods for global optimization on GPU ⋮ Solving large-scale optimization problems related to Bell's theorem ⋮ A convergent variant of the Nelder--Mead algorithm ⋮ Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ Inverse analysis of an internal reforming solid oxide fuel cell system using simplex search method ⋮ Nonsmooth optimization for multidisk \(H_\infty\) synthesis ⋮ Effect of dimensionality on the Nelder–Mead simplex method ⋮ A study of the performance of classical minimizers in the quantum approximate optimization algorithm ⋮ Generalized pattern search methods for a class of nonsmooth optimization problems with structure ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization ⋮ Maximising output from oil reservoirs without water breakthrough ⋮ Derivative-free optimization methods ⋮ Less is more: Simplified Nelder-Mead method for large unconstrained optimization ⋮ Multi-direction-based Nelder–Mead method ⋮ Rational Spectral Filters with Optimal Convergence Rate ⋮ A derivative-free descent method in set optimization ⋮ Direct search methods: Then and now ⋮ A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM ⋮ Improved parallel chaos optimization algorithm
Uses Software
This page was built for publication: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
