An augmented Lagrangian method exploiting an active-set strategy and second-order information
From MaRDI portal
Publication:2139257
Abstract: In this paper, we consider nonlinear optimization problems with nonlinear equality constraints and bound constraints on the variables. For the solution of such problems, many augmented Lagrangian methods have been defined in the literature. Here, we propose to modify one of these algorithms, namely ALGENCAN by Andreani et al., in such a way to incorporate second-order information into the augmented Lagrangian framework, using an active-set strategy. We show that the overall algorithm has the same convergence properties as ALGENCAN and an asymptotic quadratic convergence rate under suitable assumptions. The numerical results confirm that the proposed algorithm is a viable alternative to ALGENCAN with greater robustness.
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
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
- A two-stage active-set algorithm for bound-constrained optimization
- 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
- An active set feasible method for large-scale minimization problems with bound constraints
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Complexity and performance of an augmented Lagrangian algorithm
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- 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
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- 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
- Practical augmented Lagrangian methods for constrained optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
Cited in
(3)
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)
