Subgradient methods for huge-scale optimization problems
Author:
- 25 May 2013
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 146 (1-2) , 275-297
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite functionMathematical Programming, 2012
- First-order algorithm with ${\mathcal{O}({\rm ln}(1{/}\epsilon))}$ convergence for ${\epsilon}$ -equilibrium in two-person zero-sum gamesMathematical Programming, 2010
- Primal-dual subgradient methods for convex problemsMathematical Programming, 2007
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Interior-Point Polynomial Algorithms in Convex Programming1994
- Minimization Methods for Non-Differentiable Functions1985