Universal gradient methods for convex optimization problems
(2015) Mathematical Programming — Vol. 152, n° 1, p. 381-404 (2015)
Files
document.pdf
Restricted Access - Adobe PDF
- 502.3 KB
Details
- Authors
- Abstract
- In this paper, we present new methods for black-box convex minimization. They do not need to know in advance the actual level of smoothness of the objective function. Their only essential input parameter is the required accuracy of the solution. At the same time, for each particular problem class they automatically ensure the best possible rate of convergence. We confirm our theoretical results by encouraging numerical experiments, which demonstrate that the fast rate of convergence, typical for the smooth optimization problems, sometimes can be achieved even on nonsmooth problem instances.
- Affiliations
Citations
Nesterov, Y. (2015). Universal gradient methods for convex optimization problems. Mathematical Programming, 152(1), 381-404. https://doi.org/10.1007/s10107-014-0790-0 (Original work published 2015)