Methods of unconditional minimization of functions using a simplex

DOI10.1007/BF01095651MaRDI QIDQ1119477zbMATH OpenOpenAlexFDO

Authors Igor Yaroslavich Zabotin

Publication date 1979

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01095651

zbMATH Keywords

continuously differentiable convex functionsn-dimensional simplexunconstrained minimization

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

The problem of unconstrained minimization of continuously differentiable convex functions is considered. Two iterative methods are presented, in which the choice of the descending direction is made with the help of an n-dimensional simplex.

Recommendations

• A modified simplex method
• Numerical methods of minimization of nonlinear functions on disjoint simplices
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Choosing descent directions in unconstrained minimization problems
• Minimization methods for functions on simple sets

Cites work

• Convex Analysis
• scientific article; zbMATH DE number 3372755 (Why is no real title available?)
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)

Cited in

(15)

• Minimal pairs representing selections of four linear functions in \(\mathbb{R}^3\)
• A modified simplex method
• scientific article; zbMATH DE number 3889289 (Why is no real title available?)
• scientific article; zbMATH DE number 3848513 (Why is no real title available?)
• scientific article; zbMATH DE number 3876932 (Why is no real title available?)
• scientific article; zbMATH DE number 3936954 (Why is no real title available?)
• Numerical methods of minimization of nonlinear functions on disjoint simplices
• Minimization methods for functions on simple sets
• scientific article; zbMATH DE number 4079167 (Why is no real title available?)
• scientific article; zbMATH DE number 494369 (Why is no real title available?)
• A cyclic iterative Chebyshev method for unconstrained minimization of functions
• scientific article; zbMATH DE number 4593 (Why is no real title available?)
• Fortified-Descent Simplicial Search Method: A General Approach
• A recursive direct search algorithm for a minimization of multidimensional function
• Choosing descent directions in unconstrained minimization problems

This page was built for publication: Methods of unconditional minimization of functions using a simplex

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