Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programming
- 6 February 2009
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 126 (1) , 1-29
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Smooth Optimization with Approximate GradientSIAM Journal on Optimization, 2008
- Large-scale semidefinite programming via a saddle point Mirror-Prox algorithmMathematical Programming, 2006
- Smoothing Technique and its Applications in Semidefinite OptimizationMathematical Programming, 2006
- Interior Gradient and Proximal Methods for Convex and Conic OptimizationSIAM Journal on Optimization, 2006
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 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
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- Convex Analysis and Minimization Algorithms II1993