… compact convex set intersected with an affine manifold. We present first-order methods for
this … on an inexact version of the classical augmented Lagrangian (AL) approach, where the …

… In this paper, we work on general convex programs with both … the inexact ALM and estimate
its iteration complexity in terms of the … first-order method for composite convex programs. The …

… (1) reduces to an ordinary convex programming problem … a first-order I-AL method and
present its iteration complexity. … first-order I-AL method and present its iteration complexity. In …

… iteration complexity analysis of inexact first-order Lagrangian and penalty methods for solving
cone-constrained convex … For inexact (fast) gradient augmented Lagrangian methods, we …

… a first-order I-AL method and present its iteration complexity. … first-order I-AL method and
present its iteration complexity. In … first-order methods for solving a class of convex optimization …

… Also, we analyze the iteration complexity of the proposed method. We show that to reach
an ε solution (see Definition 1), O(ε−1) gradient evaluations are sufficient. In addition, we …

… • Also, we analyze the iteration complexity of the proposed method. We show that to reach …
Hessian of the augmented Lagrangian function near the nondegenerate primal-dual solution. …

… convex programs with finite constraints can be written into (1.1). Examples include linearly
constrained (convex or nonconvex) quadratic programming (… the iteration complexity result of …

… An iteration complexity of the method for finding an approximate stationary point of the
aforementioned special minimax problem was established in [10, 15, 61], respectively. Yet, their …

… augmented Lagrangian (NL-IAPIAL) method for solving constrained nonconvex composite
optimization … are smooth and convex with respect to the order given by a closed convex cone. …