Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
type: Item
instance of: scholarly article
title: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
zbMATH Open document ID: 1163.90041
author: E. G. Birgin
author: R. Andreani
author: J. M. Martínez
author: María Laura Schuverdt
published in: Mathematical Programming. Series A. Series B
publication date: 2008-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5228566
zbMATH Keywords: Nonlinear programming
zbMATH Keywords: Augmented Lagrangian methods
zbMATH Keywords: KKT systems
zbMATH Keywords: Numerical experiments
describes a project that uses: CUTE
describes a project that uses: PATH Solver
describes a project that uses: LANCELOT
describes a project that uses: SPG
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s10107-006-0077-1
OpenAlex ID: W2155865164
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: On the relation between constant positive linear dependence condition and quasinormality constraint qualification
cites work: Q4209222
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: Inexact spectral projected gradient methods on convex sets
cites work: CUTE
cites work: Q4023146
cites work: Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
cites work: Benchmarking optimization software with performance profiles.
cites work: Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
cites work: Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
cites work: Duality-based domain decomposition with natural coarse-space for variational inequalities
cites work: Regularity Properties of a Semismooth Reformulation of Variational Inequalities
cites work: Q4353534
cites work: A simply constrained optimization reformulation of KKT systems arising from variational inequalities
cites work: Q4226179
cites work: Analysis and implementation of a dual algorithm for constrained optimization
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Lagrange Multipliers and Optimality
cites work: Sensitivity Analysis of Parameterized Variational Inequalities
DOI: 10.1007/S10107-006-0077-1
description: scientific article