Random Gradient-Free Minimization of Convex Functions

In this paper, we prove new complexity bounds for methods of convex optimization based only on computation of the function value. The search directions of our schemes are normally distributed random Gaussian vectors. It appears that such methods usually need at most n times more iterations than the...

Full description

Saved in:

Bibliographic Details
Published in:	Foundations of computational mathematics Vol. 17; no. 2; pp. 527 - 566
Main Authors:	Nesterov, Yurii, Spokoiny, Vladimir
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2017 Springer Nature B.V
Subjects:	Applications of Mathematics Computation Computational geometry Computer Science Convergence Convex analysis Convexity Economic models Economics Iterative methods Linear and Multilinear Algebras Math Applications in Computer Science Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Matrix Theory Nonlinear programming Numerical Analysis Optimization Texts Vectors (mathematics) 0C47 68Q25 Convex optimization Random methods 90C25 Complexity bounds Stochastic optimization Derivative-free methods
ISSN:	1615-3375, 1615-3383
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!