Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

DOI10.1007/S10107-006-0077-1zbMath1163.90041OpenAlexW2155865164MaRDI QIDQ2467167

Ernesto G. Birgin, María Laura Schuverdt, José Mario Martínez, Roberto Andreani

Publication date: 21 January 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-006-0077-1

zbMATH Keywords

Numerical experimentsNonlinear programmingKKT systemsAugmented Lagrangian methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)

Related Items (85)

A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming ⋮ Fast convergence of an inexact interior point method for horizontal complementarity problems ⋮ A parallel-in-time multiple shooting algorithm for large-scale PDE-constrained optimal control problems ⋮ Safeguarded Augmented Lagrangian Methods in Banach Spaces ⋮ An augmented Lagrangian method exploiting an active-set strategy and second-order information ⋮ The use of squared slack variables in nonlinear second-order cone programming ⋮ An inexact restoration strategy for the globalization of the sSQP method ⋮ A cover partitioning method for bound constrained global optimization ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ A trust-region derivative-free algorithm for constrained optimization ⋮ Partial spectral projected gradient method with active-set strategy for linearly constrained optimization ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ On the multiplier-penalty-approach for quasi-variational inequalities ⋮ Improved convergence order for augmented penalty algorithms ⋮ New and improved results for packing identical unitary radius circles within triangles, rectangles and strips ⋮ A practical relative error criterion for augmented Lagrangians ⋮ Un algoritmo Newton inexacto para complementariedad horizontal ⋮ An augmented Lagrangian trust region method for equality constrained optimization ⋮ On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming ⋮ On the use of third-order models with fourth-order regularization for unconstrained optimization ⋮ Evaluating bound-constrained minimization software ⋮ New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact ⋮ An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities ⋮ On the cost of solving augmented Lagrangian subproblems ⋮ A new Lagrangian-based first-order method for nonconvex constrained optimization ⋮ Weak notions of nondegeneracy in nonlinear semidefinite programming ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization ⋮ A projected-gradient interior-point algorithm for complementarity problems ⋮ A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties ⋮ Some results on augmented Lagrangians in constrained global optimization via image space analysis ⋮ Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming ⋮ Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters ⋮ On the natural merit function for solving complementarity problems ⋮ Global minimization using an augmented Lagrangian method with variable lower-level constraints ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ An example comparing the standard and safeguarded augmented Lagrangian methods ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces ⋮ Minimizing the object dimensions in circle and sphere packing problems ⋮ Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Algorithm for inequality-constrained least squares problems ⋮ Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization ⋮ Assessing the reliability of general-purpose inexact restoration methods ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ Packing circles within ellipses ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ An augmented Lagrangian fish swarm based method for global optimization ⋮ Global convergence of a robust filter SQP algorithm ⋮ Continuous GRASP with a local active-set method for bound-constrained global optimization ⋮ On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints ⋮ Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints ⋮ A relaxed constant positive linear dependence constraint qualification and applications ⋮ A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ On the convergence of inexact augmented Lagrangian methods for problems with convex constraints ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ An augmented Lagrangian method for cardinality-constrained optimization problems ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ Adaptive augmented Lagrangian methods: algorithms and practical numerical experience ⋮ TACO: a toolkit for AMPL control optimization ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization ⋮ Low order-value optimization and applications ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming ⋮ Complexity and performance of an Augmented Lagrangian algorithm ⋮ Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences ⋮ Global optimization of protein-peptide docking by a filling function method ⋮ Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it ⋮ On Optimality Conditions for Nonlinear Conic Programming ⋮ A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method ⋮ Convergence results of an augmented Lagrangian method using the exponential penalty function ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

Uses Software

• CUTEr
• PATH Solver
• CUTE
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A simply constrained optimization reformulation of KKT systems arising from variational inequalities
• Analysis and implementation of a dual algorithm for constrained optimization
• Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
• 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
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• The multiplier method of Hestenes and Powell applied to convex programming
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Lagrange Multipliers and Optimality
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Regularity Properties of a Semismooth Reformulation of Variational Inequalities
• CUTE
• Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
• Inexact spectral projected gradient methods on convex sets
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
• On the Barzilai and Borwein choice of steplength for the gradient method
• Algorithm 813
• Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
• Sensitivity Analysis of Parameterized Variational Inequalities
• Duality-based domain decomposition with natural coarse-space for variational inequalities
• Benchmarking optimization software with performance profiles.

This page was built for publication: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification