Constrained composite optimization and augmented Lagrangian methods
From MaRDI portal
Abstract: We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling framework for a variety of applications. We study stationarity and regularity concepts, and propose a flexible augmented Lagrangian scheme. We provide a theoretical characterization of the algorithm and its asymptotic properties, deriving convergence results for fully nonconvex problems. It is demonstrated how the inner subproblems can be solved by off-the-shelf proximal methods, notwithstanding the possibility to adopt any solvers, insofar as they return approximate stationary points. Finally, we describe our matrix-free implementation of the proposed algorithm and test it numerically. Illustrative examples show the versatility of constrained composite programs as a modeling tool and expose difficulties arising in this vast problem class.
Recommendations
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
- An alternating augmented Lagrangian method for constrained nonconvex optimization
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- A cone-continuity constraint qualification and algorithmic consequences
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- A penalty method for rank minimization problems in symmetric matrices
- A primal-dual augmented Lagrangian
- A sequential homotopy method for mathematical programming problems
- A sequential quadratic optimization algorithm with rapid infeasibility detection
- ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An augmented Lagrangian method for optimization problems in Banach spaces
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Complementarity formulations of \(\ell_0\)-norm optimization
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Convex analysis and monotone operator theory in Hilbert spaces
- Disjunctive programming
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Julia: a fresh approach to numerical computing
- Multiplier and gradient methods
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
- New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
- Numerical methods for mixed-integer optimal control problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On a primal-dual Newton proximal method for convex quadratic programs
- On the best achievable quality of limit points of augmented Lagrangian schemes
- On the complexity of an augmented Lagrangian method for nonconvex optimization
- On the limited memory BFGS method for large scale optimization
- Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
- Optimization for data analysis
- Optimization problems involving group sparsity terms
- Practical augmented Lagrangian methods for constrained optimization
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Proximal splitting methods in signal processing
- Proximité et dualité dans un espace hilbertien
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Second-Order Switching Time Optimization for Switched Dynamical Systems
- Stabilized optimization via an NCL algorithm
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- Variational Analysis
Cited in
(28)- A unified primal-dual algorithm framework for inequality constrained problems
- Convergence of nonmonotone proximal gradient methods under the Kurdyka-Łojasiewicz property without a global Lipschitz assumption
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Proximal gradient methods beyond monotony
- Local properties and augmented Lagrangians in fully nonconvex composite optimization
- Strong global convergence properties of algorithms for nonlinear symmetric cone programming
- An interior proximal gradient method for nonconvex optimization
- Variational Poisson denoising via augmented Lagrangian methods
- Sequential M-stationarity conditions for general optimization problems
- Strength-based collaborative topology optimization for continuous fiber reinforced composites
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Fuzzy multiplier, sum and intersection rules in non-Lipschitzian settings: decoupling approach revisited
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
- Inertial accelerated primal-dual algorithms for non-smooth convex optimization problems with linear equality constraints
- A penalty barrier framework for nonconvex constrained optimization
- A unified approach for minimizing composite norms
- Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
- A proximal-gradient method for equality constrained optimization
- Augmented Lagrangian duality for composite optimization problems
- Consistent approximations in composite optimization
- Lagrangian methods for composite optimization
- Local convergence of augmented Lagrangian methods for composite optimization
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results
- An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization
This page was built for publication: Constrained composite optimization and augmented Lagrangian methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110459)
