A class of algorithms for computing the minimal value of a convex functionfover[0 1]^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊

DOI10.1080/02331938608843142zbMath0595.90068OpenAlexW2004429628MaRDI QIDQ3727747

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843142

zbMATH Keywords

nonsmooth golden section search sequential minimization stability and complexity of algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cites Work

A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms

This page was built for publication: A class of algorithms for computing the minimal value of a convex functionfover[0 1]^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊

A class of algorithms for computing the minimal value of a convex functionfover[0 1]kwithin accuracy ∊, when the evaluations offare made within accuracy ∊

A class of algorithms for computing the minimal value of a convex functionfover[0 1]^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊