A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems
- 26 April 2023
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 202 (1) , 388-420
Abstract
No abstract availableKeywords
Funding Information
- ONR (00014-18-1-2077)
- AFOSR (FA9550-22-1-0088)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (312559/2019-4)
This publication has 32 references indexed in Scilit:
- Accelerated gradient methods for nonconvex nonlinear and stochastic programmingMathematical Programming, 2015
- Iteration-complexity of first-order augmented Lagrangian methods for convex programmingMathematical Programming, 2015
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium ProblemsSIAM Journal on Optimization, 2015
- Optimal Primal-Dual Methods for a Class of Saddle Point ProblemsSIAM Journal on Optimization, 2014
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order MethodsSIAM Journal on Optimization, 2013
- Iteration-complexity of first-order penalty methods for convex programmingMathematical Programming, 2012
- A First-Order Augmented Lagrangian Method for Compressed SensingSIAM Journal on Optimization, 2012
- A First-Order Smoothed Penalty Method for Compressed SensingSIAM Journal on Optimization, 2011
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976