Primal-dual subgradient methods for convex problems
Top Cited Papers
- 19 June 2007
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 120 (1), 221-259
- https://doi.org/10.1007/s10107-007-0149-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dual extrapolation and its applications to solving variational inequalities and related problemsMathematical Programming, 2006
- Interior projection-like methods for monotone variational inequalitiesMathematical Programming, 2005
- Excessive Gap Technique in Nonsmooth Convex MinimizationSIAM Journal on Optimization, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Introductory Lectures on Convex OptimizationApplied Optimization, 2004
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point ProblemsSIAM Journal on Optimization, 2004
- Mirror descent and nonlinear projected subgradient methods for convex optimizationOperations Research Letters, 2003
- The Ordered Subsets Mirror Descent Optimization Method with Applications to TomographySIAM Journal on Optimization, 2001
- Convex Analysis and Minimization Algorithms IIPublished by Springer Science and Business Media LLC ,1993
- Minimization Methods for Non-Differentiable FunctionsSpringer Series in Computational Mathematics, 1985