Constrained composite optimization and augmented Lagrangian methods
From MaRDI portal
Publication:6110459
DOI10.1007/s10107-022-01922-4zbMath1522.90197arXiv2203.05276MaRDI QIDQ6110459
Patrick Mehlitz, Xiaoxi Jia, Christian Kanzow, Alberto De Marchi
Publication date: 1 August 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.05276
nonsmooth optimizationnonlinear optimizationaugmented Lagrangian methodscomposite nonconvex optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Set-valued and variational analysis (49J53)
Related Items
A unified primal-dual algorithm framework for inequality constrained problems, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- A primal-dual augmented Lagrangian
- On the limited memory BFGS method for large scale optimization
- A penalty method for rank minimization problems in symmetric matrices
- Stabilized optimization via an NCL algorithm
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- A sequential homotopy method for mathematical programming problems
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- On a primal-dual Newton proximal method for convex quadratic programs
- On the best achievable quality of limit points of augmented Lagrangian schemes
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Optimization problems involving group sparsity terms
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- Multiplier and gradient methods
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Proximal Splitting Methods in Signal Processing
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Julia: A Fresh Approach to Numerical Computing
- A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Second-Order Switching Time Optimization for Switched Dynamical Systems
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
- First-Order Methods in Optimization
- An Augmented Lagrangian Method for Optimization Problems in Banach Spaces
- Disjunctive Programming
- Optimization for Data Analysis
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
- Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness
- New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Proximité et dualité dans un espace hilbertien
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
- Convex analysis and monotone operator theory in Hilbert spaces
- An augmented Lagrangian method for optimization problems with structured geometric constraints
