A restarted and modified simplex search for unconstrained optimization
From MaRDI portal
Recommendations
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. I: Theoretical analysis
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. II: Numerical analysis
- Less is more: simplified Nelder-Mead method for large unconstrained optimization
- A modified simplex method
- Efficient Implementation of the Nelder-Mead Search Algorithm
Cites work
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- scientific article; zbMATH DE number 3421856 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A continuous genetic algorithm designed for the global optimization of multimodal functions
- A convergent variant of the Nelder--Mead algorithm
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- A niche hybrid genetic algorithm for global optimization of continuous multimodal functions
- A revised simplex search procedure for stochastic simulation response surface optimization
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
- 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
- Fortified-Descent Simplicial Search Method: A General Approach
- General variable neighborhood search for the continuous optimization
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- Grid restrained Nelder-Mead algorithm
- Hybrid continuous interacting ant colony aimed at enhanced global optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- On the Convergence of Pattern Search Algorithms
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Taboo Search: An Approach to the Multiple Minima Problem
- Tabu search applied to global optimization
- Tabu search directed by direct search methods for nonlinear global optimization
- The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
- Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
- Variable neighborhood search
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(10)- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. I: Theoretical analysis
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. II: Numerical analysis
- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming
- Multi-direction-based Nelder-Mead method
- Variable neighborhood search: basics and variants
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
- Nelder-Mead method with local selection using memory for discrete stochastic optimization
- Less is more: simplified Nelder-Mead method for large unconstrained optimization
- Gaussian variable neighborhood search for continuous optimization
- Global optimization using a genetic algorithm with hierarchically structured population
This page was built for publication: A restarted and modified simplex search for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833553)