Mathematical Programming

, Volume 146, Issue 1–2, pp 275–297

Subgradient methods for huge-scale optimization problems

Full Length Paper Series A

DOI: 10.1007/s10107-013-0686-4

Cite this article as:
Nesterov, Y. Math. Program. (2014) 146: 275. doi:10.1007/s10107-013-0686-4

Abstract

We consider a new class of huge-scale problems, the problems with sparse subgradients. The most important functions of this type are piece-wise linear. For optimization problems with uniform sparsity of corresponding linear operators, we suggest a very efficient implementation of subgradient iterations, which total cost depends logarithmically in the dimension. This technique is based on a recursive update of the results of matrix/vector products and the values of symmetric functions. It works well, for example, for matrices with few nonzero diagonals and for max-type functions. We show that the updating technique can be efficiently coupled with the simplest subgradient methods, the unconstrained minimization method by B.Polyak, and the constrained minimization scheme by N.Shor. Similar results can be obtained for a new nonsmooth random variant of a coordinate descent scheme. We present also the promising results of preliminary computational experiments.

Keywords

Nonsmooth convex optimization Complexity bounds  Subgradient methods Huge-scale problems 

Mathematics Subject Classification

90C25 90C47 68Q25 

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2013

Authors and Affiliations

  1. 1.Center for Operations Research and Econometrics (CORE)Catholic University of Louvain (UCL)Louvain-la-NeuveBelgium

Personalised recommendations