One class of methods of unconditional minimization of a convex function, having a high rate of convergence

DOI10.1016/0041-5553(84)90234-9zbMath0605.90096OpenAlexW2032676126MaRDI QIDQ3743111

Yu. E. Nesterov

Publication date: 1984

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(84)90234-9

zbMATH Keywords

unconstrained optimizationrate of convergencesmooth convex function

Mathematics Subject Classification ID

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

Related Items (2)

Algorithms of inertial mirror descent in convex problems of stochastic optimization ⋮ A delayed weighted gradient method for strictly convex quadratic minimization

This page was built for publication: One class of methods of unconditional minimization of a convex function, having a high rate of convergence