An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
From MaRDI portal
Publication:6097764
DOI10.1007/s10589-023-00464-5zbMath1519.90186arXiv2110.11151MaRDI QIDQ6097764
Renato D. C. Monteiro, WeiWei Kong
Publication date: 7 June 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11151
iteration complexityinexact proximal augmented Lagrangian methodinner accelerated first-order methodslinearly constrained smooth nonconvex composite programs
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems, Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming
Cites Work
- An adaptive accelerated first-order method for convex optimization
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Iteration-complexity of first-order penalty methods for convex programming
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- A First-Order Augmented Lagrangian Method for Compressed Sensing
- A First-Order Smoothed Penalty Method for Compressed Sensing
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
- Convex Analysis
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
