An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- 1 March 2023
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 85 (2) , 509-545
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- U.S. Department of Energy (DE-AC05-00OR22725)
- National Science Foundation (CCF-1740776)
- Exascale Computing Project (17-SC-20-SC)
- Office of Naval Research Global (N00014-18-1-2077)
- Air Force Office of Scientific Research (FA9550-22-1-0088)
This publication has 20 references indexed in Scilit:
- Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimizationMathematical Programming, 2019
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysisComputational Optimization and Applications, 2018
- Iteration complexity analysis of dual first-order methods for conic convex programmingOptimization Methods and Software, 2016
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimizationOptimization Letters, 2016
- An adaptive accelerated first-order method for convex optimizationComputational Optimization and Applications, 2015
- Iteration-complexity of first-order augmented Lagrangian methods for convex programmingMathematical Programming, 2015
- 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
- Convex Analysis1970