Fetching the paper…
Reading the bibliography…
First-order methods (FOMs) have been widely used for solving large-scale problems.
Multiplier and gradient methods
M. R. Hestenes · 1969
Earlier work this paper cites.
A method for non-linear constraints in minimization problems
M. J. Powell · 1969
Earlier work this paper cites.
Convex analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
A dual approach to solving nonlinear programming problems by unconstrained optimization
R. T. Rockafellar · 1973
Earlier work this paper cites.
A neyman-pearson approach to statistical learning
C. Scott and R. Nowak · 2005
Earlier work this paper cites.
Neyman-pearson classification, convexity and stochastic constraints
P. Rigollet and X. Tong · 2011
Earlier work this paper cites.
Clustering by low-rank doubly stochastic matrix decomposition
Z. Yang and E. Oja · 2012
Earlier work this paper cites.
An augmented lagrangian method for conic convex programming
N. S. Aybat and G. Iyengar · 2013
Earlier work this paper cites.
Iteration-complexity of first-order penalty methods for convex programming
G. Lan and R. D. Monteiro · 2013
Earlier work this paper cites.
Rate analysis of inexact dual first-order methods application to dual decomposition
I. Necoara and V. Nedelcu · 2013
Cited alongside, same era.
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
Q. Lin and L. Xiao · 2014
Cited alongside, same era.
Computational complexity of inexact gradient augmented lagrangian methods: application to constrained mpc
V. Nedelcu, I. Necoara, and Q. Tran-Dinh · 2014
Cited alongside, same era.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
G. Lan and R. D. Monteiro · 2016
Cited alongside, same era.
A primal-dual algorithm for general convex-concave saddle point problems
E. Y. Hamedani and N. S. Aybat · 2018
Cited alongside, same era.
F. Li and Z. Qu · 2019
Later among the works it cites.
Inexact proximal-point penalty methods for non-convex optimization with non-convex constraints
Q. Lin, R. Ma, and Y. Xu · 2019
Later among the works it cites.
On the nonergodic convergence rate of an inexact augmented lagrangian framework for composite convex programming
Y.-F. Liu, X. Liu, and S. Ma · 2019
Later among the works it cites.
Proximally constrained methods for weakly convex optimization with weakly convex constraints
R. Ma, Q. Lin, and T. Yang · 2019
Later among the works it cites.
An inexact augmented lagrangian framework for nonconvex optimization with nonlinear constraints
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. Lu and Z. Zhou · 2018
Cited alongside, same era.
Proximal point methods for optimization with nonconvex functional constraints
D. Boob, Q. Deng, and G. Lan · 2019
Cited alongside, same era.
Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
W. Kong, J. G. Melo, and R. D. Monteiro · 2019
Cited alongside, same era.
M. F. Sahin, A. Alacaoglu, F. Latorre, V. Cevher, et al · 2019
Later among the works it cites.
Z. Li and Y. Xu · 2020
Closest in time.
First-order methods for constrained convex programming based on linearized augmented lagrangian function
Y. Xu · 2021
Closest in time.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Y. Xu · 2021
Closest in time.