Iteration complexity of first-order augmented Lagrangian methods for convex conic programming

Z Lu, Z Zhou - arXiv preprint arXiv:1803.09941, 2018 - arxiv.org
In this paper we consider a class of convex conic programming. In particular, we first
propose an inexact augmented Lagrangian (I-AL) method that resembles the classical I-AL …
被引用次数：22 相关文章

Iteration complexity of first-order augmented Lagrangian methods for convex conic programming

Z Lu, Z Zhou - arXiv e-prints, 2018 - ui.adsabs.harvard.edu
In this paper we consider a class of convex conic programming. In particular, we first
propose an inexact augmented Lagrangian (I-AL) method that resembles the classical I-AL …
[PDF] github.io

[PDF][PDF] Iteration Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming

Z Lu, Z Zhou - zhaosong-lu.github.io
In this paper we consider a class of convex conic programming. In particular, we first
propose an inexact augmented Lagrangian (I-AL) method that resembles the classical I-AL …
[PDF] researchgate.net

[PDF][PDF] Iteration Complexity of First-Order Augmented Lagrangian Methods for Convex Conic Programming

Z Lu, Z Zhou - researchgate.net
In this paper we consider a class of convex conic programming. In particular, we first
propose an inexact augmented Lagrangian (I-AL) method that resembles the classical I-AL …