REVIEW 1 cited by
On the non-ergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we consider the linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function. We propose an inexact augmented Lagrangian (IAL) framework for solving the problem. The stopping criterion used in solving the augmented Lagrangian (AL) subproblem in the proposed IAL framework is weaker and potentially much easier to check than the one used in most of the existing IAL frameworks/methods. We analyze the global convergence and the non-ergodic convergence rate of the proposed IAL framework.
Forward citations
Cited by 1 Pith paper
-
A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
A SPIDER-type stochastic subgradient method with smoothed exact penalization reaches (epsilon,epsilon)-KKT points of expectation-constrained nonconvex nonsmooth problems in O(epsilon^-4) iterations.
Discussion (0). Continue with ORCID to comment.