A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
DOI10.1007/S10957-023-02218-ZMaRDI QIDQ6596342FDOQ6596342
Authors: J. G. Melo, Renato D. C. Monteiro, Hairong Wang 
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
iteration complexityaccelerated first-order methodslinearly constrained smooth nonconvex composite programsinexact proximal augmented Lagrangian methods
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Variational and other types of inclusions (47J22) Decomposition methods (49M27)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- A first-order smoothed penalty method for compressed sensing
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Iteration-complexity of first-order penalty methods for convex programming
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An adaptive accelerated first-order method for convex optimization
- A first-order augmented Lagrangian method for compressed sensing
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- 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
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- 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
- An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
- A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
This page was built for publication: A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596342)
