Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

References

• N. Aybat and G. Iyengar, An Augmented Lagrangian Method for Conic Convex Programming, Working paper, http://arxiv.org/abs/1302.6322, 2013.
   Google Scholar
• A. Beck and M. Teboulle, A fast iterative shrinkage-thresholding algorithm for linear inverse problems, SIAM J. Imaging Sci. 2(1) (2009), pp. 183–202. doi: 10.1137/080716542
   Web of Science ®Google Scholar
• A. Beck and M. Teboulle, Smoothing and first order methods: A unified framework, SIAM J. Optim. 22(2) (2012), pp. 557–580. doi: 10.1137/100818327
   Web of Science ®Google Scholar
• R. Bot and C. Hendrich, A variable smoothing algorithm for solving convex optimization problems, TOP 23(1) (2015), pp. 124–150. doi: 10.1007/s11750-014-0326-z
   Web of Science ®Google Scholar
• R. Bot and C. Hendrich, On the acceleration of the double smoothing technique for unconstrained convex optimization problems, Optimization 64(2) (2015), pp. 265–288. doi: 10.1080/02331934.2012.745530
   Web of Science ®Google Scholar
• O. Devolder, F. Glineur, and Yu. Nesterov, Double smoothing technique for large-scale linearly constrained convex optimization, SIAM J. Optim. 22(2) (2012), pp. 702–727. doi: 10.1137/110826102
   Web of Science ®Google Scholar
• O. Devolder, F. Glineur, and Yu. Nesterov, First-order methods of smooth convex optimization with inexact oracle, Math. Programm. 146 (2014), pp. 37–75. doi: 10.1007/s10107-013-0677-5
   Web of Science ®Google Scholar
• G. Lan, Z. Lu, and R. Monteiro, Primal–dual first order methods with O(1/ϵ) iteration-complexity for cone programming, Math. Program. 126 (2011), pp. 1–29. doi: 10.1007/s10107-008-0261-6
   Web of Science ®Google Scholar
• G. Lan and R. Monteiro, Iteration-complexity of first order penalty methods for convex programming, Math. Program. 138 (2013), pp. 115–139. doi: 10.1007/s10107-012-0588-x
   Web of Science ®Google Scholar
• G. Lan and R. Monteiro, Iteration-complexity of first order augmented Lagrangian methods for convex programming, Mathematical Programming, doi:10.1007/s10107-015-0861-x, 2015.
   Google Scholar
• R. Monteiro and B. Svaiter, On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean, SIAM J. Optim. 20(6) (2010), pp. 2755–2787. doi: 10.1137/090753127
   Web of Science ®Google Scholar
• I. Necoara and V. Nedelcu, Rate analysis of inexact dual first order methods: application to dual decomposition, IEEE Trans. Autom. Control. 59(5) (2014), pp. 1232–1243. doi: 10.1109/TAC.2013.2294614
   Web of Science ®Google Scholar
• I. Necoara and A. Patrascu, Iteration complexity analysis of dual first order methods for conic convex programming, Optim. Method Softw. 31(3) (2016), pp. 645–678. doi: 10.1080/10556788.2016.1161763
   Web of Science ®Google Scholar
• I. Necoara, A. Patrascu, and F. Glineur, Complexity certifications of first order inexact Lagrangian and penalty methods for conic convex programming, Technical Report, University Politehnica of Bucharest, 2015, https://arxiv.org/abs/1506.05320.
   Google Scholar
• I. Necoara and J.A.K. Suykens, Application of a smoothing technique to decomposition in convex optimization, IEEE Trans. Autom. Control. 53(11) (2008), pp. 2674–2679. doi: 10.1109/TAC.2008.2007159
   Web of Science ®Google Scholar
• V. Nedelcu, I. Necoara, and Q. Tran-Dinh, Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC, SIAM J. Control Optim. 52(5) (2014), pp. 3109–3134. doi: 10.1137/120897547
   Web of Science ®Google Scholar
• A. Nedic and A. Ozdaglar, Approximate primal solutions and rate analysis for dual subgradient methods, SIAM J. Optim. 19(4) (2009), pp. 1757–1780. doi: 10.1137/070708111
   Web of Science ®Google Scholar
• A. Nemirovski, Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim. 15(1) (2004), pp. 229–251. doi: 10.1137/S1052623403425629
   Web of Science ®Google Scholar
• Yu. Nesterov, Smooth minimization of non-smooth functions, Math. Program. 103 (2005), pp. 127–152. doi: 10.1007/s10107-004-0552-5
   Web of Science ®Google Scholar
• Yu. Nesterov, Dual extrapolation and its applications to solving variational inequalities and related problems, Math. Program. 109 (2007), pp. 319–344. doi: 10.1007/s10107-006-0034-z
   Web of Science ®Google Scholar
• Yu. Nesterov, Gradient methods for minimizing composite functions, Math. Program. 140 (2013), pp. 125–161. doi: 10.1007/s10107-012-0629-5
   Web of Science ®Google Scholar
• Yu. Nesterov, Subgradient methods for huge-scale optimization problems, Math. Program. 146 (2014), pp. 275–297. www.imtlucca.it/embopt-14/Slides/nesterov.pdf. doi: 10.1007/s10107-013-0686-4
   Web of Science ®Google Scholar
• R.T. Rockafellar and R. Wets, Variational Analysis, Springer-Verlag, Berlin, 1998.
   Google Scholar
• Q. Tran-Dinh and V. Cevher, A primal–dual algorithmic framework for constrained convex minimization, Technical report, 2014, http://arxiv.org/abs/1406.5403.
   Google Scholar
• Q. Tran-Dinh, I. Necoara, and M. Diehl, Fast inexact distributed optimization algorithms for separable convex optimization, Optimization 65(2) (2016), pp. 325–356. doi: 10.1080/02331934.2015.1044898
   Web of Science ®Google Scholar
• P. Tseng, On accelerated proximal gradient methods for convex-concave optimization, SIAM J. Optim. 28 (2008), pp. 3150–3158.
   Google Scholar
• A. Yurtsever, Q. Tran-Dinh, and V. Cevher, Universal Primal–Dual Proximal-Gradient Methods, Proceedings of Neural Information Processing Systems, 2015, http://arxiv.org/abs/1502.03123.
   Google Scholar