Algorithms for approximate calculation of the minimum of a convex function from its values

DOI10.1007/BF02312467zbMath0870.90088OpenAlexW2166691108MaRDI QIDQ1358455

Vladimir Yu. Protasov

Publication date: 15 July 1997

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityconvex functionnumerical minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (4)

Random gradient-free minimization of convex functions ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Information complexity of mixed-integer convex optimization ⋮ Efficient Convex Optimization with Oracles

Cites Work

• Differentiation of integrals in \(\mathbb{R}^n\)
• Unnamed Item

This page was built for publication: Algorithms for approximate calculation of the minimum of a convex function from its values