An adaptive search algorithm for numerical optimization

DOI10.1016/0096-3003(87)90060-9MaRDI QIDQ1100854zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1987

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(87)90060-9

zbMATH Keywords

contractionglobal minimumnonlinear optimizationnumerical experimentsexpansionreflectionstochastic algorithmline searchscalingderivative-free optimizationsimplex methodnumerical testsRosenbrock's functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Efficient Implementation of the Nelder-Mead Search Algorithm
• Numerical experiments with the one-dimensional non-linear simplex search
• A modified simplex method
• A convergent variant of the Nelder--Mead algorithm

Cites work

• scientific article; zbMATH DE number 3382096 (Why is no real title available?)
• A Simplex Method for Function Minimization

Cited in

(29)

• scientific article; zbMATH DE number 14314 (Why is no real title available?)
• scientific article; zbMATH DE number 1728444 (Why is no real title available?)
• A revised simplex search procedure for stochastic simulation response surface optimization
• Fortified-Descent Simplicial Search Method: A General Approach
• scientific article; zbMATH DE number 3848513 (Why is no real title available?)
• scientific article; zbMATH DE number 5932201 (Why is no real title available?)
• Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
• scientific article; zbMATH DE number 4179150 (Why is no real title available?)
• Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming
• One-dimensional simplex search
• A modified simplex method
• Efficient Implementation of the Nelder-Mead Search Algorithm
• Derivative free optimization in higher dimension
• scientific article; zbMATH DE number 515396 (Why is no real title available?)
• scientific article; zbMATH DE number 1187210 (Why is no real title available?)
• The use of hypothetical points in numerical optimization
• scientific article; zbMATH DE number 3952512 (Why is no real title available?)
• Numerical methods of minimization of nonlinear functions on disjoint simplices
• Numerical experiments with the one-dimensional non-linear simplex search
• Accelerating optimization by tracing valley
• Multistart global optimization algorithm based on simplex gradient
• A combined topographical search strategy with ellipsometric application
• Searching minima of an \(N\)-dimensional surface: A robust valley following method
• Some modifications of low-dimensional simplex evolution and their convergence
• An efficient interfacing of golden-section and quadratic searches
• A recursive direct search algorithm for a minimization of multidimensional function
• Convergent simplex searches and the ‘gloveless DataGlove’
• A global optimization method based on the reduced simplicial statistical model
• Efficient optimization of certain functionals in a hypercube

This page was built for publication: An adaptive search algorithm for numerical optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100854)