Smooth Optimization with Approximate Gradient

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this means in some instances computing only a few leading eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method's computational cost. This also allows sparse problems to be solved efficiently using sparse maximum eigenvalue packages.
Titled changed from "Smooth Optimization for Sparse Semidefinite Programs". New figures, tests. Final version

Keywords

Optimization and Control, 90C25; 90C22; 90C06

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/161066

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0512344
 http://arxiv.org/abs/math/0512344

Collections

arXiv