An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
DOI10.1007/s10915-023-02350-yzbMath1522.90142arXiv2207.11905OpenAlexW4386982907MaRDI QIDQ6053022
Arnesh Sujanani, Renato D. C. Monteiro
Publication date: 17 October 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.11905
adaptive methodaugmented Lagrangian methoditeration complexityfirst-order accelerated methodlinearly-constrained nonconvex composite optimizationsmooth weakly convex function
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Variational and other types of inclusions (47J22)
Related Items
Cites Work
- An adaptive accelerated first-order method for convex optimization
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- Introductory lectures on convex optimization. A basic course.
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Iteration-complexity of first-order penalty methods for convex programming
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A First-Order Augmented Lagrangian Method for Compressed Sensing
- A First-Order Smoothed Penalty Method for Compressed Sensing
- Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
- 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
- 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
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
