Grid restrained Nelder-Mead algorithm
From MaRDI portal
Publication:853559
DOI10.1007/S10589-005-3912-ZzbMATH Open1152.90658OpenAlexW2015415797MaRDI QIDQ853559FDOQ853559
Authors: Árpád Bűrmen, Janez Puhan, Tadej Tuma 
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-3912-z
Recommendations
- A convergent variant of the Nelder--Mead algorithm
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Efficient Implementation of the Nelder-Mead Search Algorithm
- CNM -- a convergent method of Nelder and Mead type.
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Testing Unconstrained Optimization Software
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- A Simplex Method for Function Minimization
- On the Convergence of Pattern Search Algorithms
- Theory of Positive Linear Dependence
- Direct search methods: Then and now
- 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
- A convergent variant of the Nelder--Mead algorithm
- Frame based methods for unconstrained optimization
- Title not available (Why is that?)
- Fortified-Descent Simplicial Search Method: A General Approach
- On the convergence of grid-based methods for unconstrained optimization
- Title not available (Why is that?)
Cited In (16)
- Increasing the efficiency of selected grid search procedures through the introduction of a best step mechanism
- CNM -- a convergent method of Nelder and Mead type.
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- A restarted and modified simplex search for unconstrained optimization
- Conjugate grids for unconstrained optimisation
- CARTopt: a random search method for nonsmooth unconstrained optimization
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Multi-direction-based Nelder-Mead method
- Unconstrained derivative-free optimization by successive approximation
- Mesh adaptive direct search with second directional derivative-based Hessian update
- Mesh adaptive direct search with simplicial Hessian update
- A simplex-based numerical framework for simple and efficient robust design optimization
- Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points
- A convergent variant of the Nelder--Mead algorithm
- Black-Box Optimization: Methods and Applications
- Derivative-free optimization methods
Uses Software
This page was built for publication: Grid restrained Nelder-Mead algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853559)
