An augmented Lagrangian method exploiting an active-set strategy and second-order information
DOI10.1007/S10957-022-02003-4zbMATH Open1492.90170arXiv2104.15018OpenAlexW3210979610MaRDI QIDQ2139257FDOQ2139257
Giampaolo Liuzzi, Andrea Cristofari, Stefano Lucidi, Gianni Di Pillo
Publication date: 17 May 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.15018
constrained optimizationaugmented Lagrangian methodslarge-scale optimizationnonlinear programming algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Benchmarking optimization software with performance profiles.
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
- An active set feasible method for large-scale minimization problems with bound constraints
- A two-stage active-set algorithm for bound-constrained optimization
- A superlinearly convergent primal β dual algorithm model for constrained optimization problems with bounded variables
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Complexity and performance of an Augmented Lagrangian algorithm
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
- Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search
Cited In (2)
Uses Software
Recommendations
- Augmented Lagrangian active set methods for obstacle problems π π
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency π π
- An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications π π
- A second-order convergence augmented Lagrangian method using non-quadratic penalty functions π π
- Augmented Lagrangian methods for variational inequality problems π π
- An Implementable Augmented Lagrangian Method for Solving Second-Order Cone Constrained Variational Inequalities π π
- Augmented Lagrangian method with alternating constraints for nonlinear optimization problems π π
- On Augmented Lagrangian Methods with General Lower-Level Constraints π π
- Augmented Lagrangian Methods for Solving Optimization Problems with Stochastic-Order Constraints π π
- A strongly convergent augmented Lagrangian method π π
This page was built for publication: An augmented Lagrangian method exploiting an active-set strategy and second-order information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139257)