Unconstrained derivative-free optimization by successive approximation
From MaRDI portal
Publication:953370
DOI10.1016/j.cam.2007.12.017zbMath1155.65044OpenAlexW2140622762MaRDI QIDQ953370
Publication date: 20 November 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.12.017
convergencenumerical examplessimplexsuccessive approximationgriddirect searchNelder-Mead algorithmMoré-Garbow-Hillstrom test suiteunconstrained derivative-free optimization
Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (2)
Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points ⋮ Rapidly convergent Steffensen-based methods for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convergent variant of the Nelder--Mead algorithm
- Grid restrained Nelder-Mead algorithm
- Convex analysis and nonlinear optimization. Theory and examples
- Direct search methods: Then and now
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- On the Convergence of Pattern Search Algorithms
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Analysis of Generalized Pattern Searches
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Theory of Positive Linear Dependence
- Frame based methods for unconstrained optimization
This page was built for publication: Unconstrained derivative-free optimization by successive approximation
