User menu

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

Bibliographic reference Necoara, I. ; Patrascu, A. ; Glineur, François. Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. In: Optimization Methods and Software, , p. 1-31 (2017)
Permanent URL
  1. Beck Amir, Teboulle Marc, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, 10.1137/080716542
  2. Beck Amir, Teboulle Marc, Smoothing and First Order Methods: A Unified Framework, 10.1137/100818327
  3. Boţ Radu Ioan, Hendrich Christopher, A variable smoothing algorithm for solving convex optimization problems, 10.1007/s11750-014-0326-z
  4. Boţ Radu Ioan, Hendrich Christopher, On the acceleration of the double smoothing technique for unconstrained convex optimization problems, 10.1080/02331934.2012.745530
  5. Devolder Olivier, Glineur François, Nesterov Yurii, Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization, 10.1137/110826102
  6. Devolder Olivier, Glineur François, Nesterov Yurii, First-order methods of smooth convex optimization with inexact oracle, 10.1007/s10107-013-0677-5
  7. Lan Guanghui, Lu Zhaosong, Monteiro Renato D. C., Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming, 10.1007/s10107-008-0261-6
  8. Lan Guanghui, Monteiro Renato D. C., Iteration-complexity of first-order penalty methods for convex programming, 10.1007/s10107-012-0588-x
  9. Lan Guanghui, Monteiro Renato D. C., Iteration-complexity of first-order augmented Lagrangian methods for convex programming, 10.1007/s10107-015-0861-x
  10. Monteiro Renato D. C., Svaiter B. F., On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean, 10.1137/090753127
  11. Necoara Ion, Nedelcu Valentin, Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition, 10.1109/tac.2013.2294614
  12. Necoara I., Patrascu A., Iteration complexity analysis of dual first-order methods for conic convex programming, 10.1080/10556788.2016.1161763
  13. Necoara Ion, Suykens Johan A. K., Application of a Smoothing Technique to Decomposition in Convex Optimization, 10.1109/tac.2008.2007159
  14. Nedelcu Valentin, Necoara Ion, Tran-Dinh Quoc, Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC, 10.1137/120897547
  15. Nedić Angelia, Ozdaglar Asuman, Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods, 10.1137/070708111
  16. Nemirovski Arkadi, Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems, 10.1137/s1052623403425629
  17. Nesterov Yu., Smooth minimization of non-smooth functions, 10.1007/s10107-004-0552-5
  18. Nesterov Yurii, Dual extrapolation and its applications to solving variational inequalities and related problems, 10.1007/s10107-006-0034-z
  19. Nesterov Yu., Gradient methods for minimizing composite functions, 10.1007/s10107-012-0629-5
  20. Nesterov Yu., Subgradient methods for huge-scale optimization problems, 10.1007/s10107-013-0686-4
  21. Rockafellar R. Tyrrell, Wets Roger J. B., Variational Analysis, ISBN:9783540627722, 10.1007/978-3-642-02431-3
  22. Tran-Dinh Q., Necoara I., Diehl M., Fast inexact decomposition algorithms for large-scale separable convex optimization, 10.1080/02331934.2015.1044898