Improving ultimate convergence of an augmented Lagrangian method
type: Item
instance of: scholarly article
title: Improving ultimate convergence of an augmented Lagrangian method
zbMATH Open document ID: 1211.90222
DOI: 10.1080/10556780701577730
author: E. G. Birgin
author: J. M. Martínez
publication date: 2008-11-19T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5368776
zbMATH Keywords: nonlinear programming
zbMATH Keywords: augmented Lagrangian methods
zbMATH Keywords: interior-point methods
zbMATH Keywords: Newton's method
zbMATH Keywords: experiments
describes a project that uses: ipfilter
describes a project that uses: CUTEr
describes a project that uses: KELLEY
describes a project that uses: TRON
describes a project that uses: LANCELOT
describes a project that uses: SNOPT
describes a project that uses: TANGO
describes a project that uses: Ipopt
describes a project that uses: ALGENCAN
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/10556780701577730
OpenAlex ID: W2057802165
cites work: Multiplier and gradient methods
cites work: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Trust Region Methods
cites work: On the relation between constant positive linear dependence condition and quasinormality constraint qualification
cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
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: Inexact spectral projected gradient methods on convex sets
cites work: A limited-memory multipoint symmetric secant method for bound constrained optimization
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: A New Active Set Algorithm for Box Constrained Optimization
cites work: Newton's Method for Large Bound-Constrained Optimization Problems
cites work: A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
cites work: Convergence properties of nonmonotone spectral projected gradient methods
cites work: Monotone projected gradient methods for large-scale box-constrained quadratic programming
cites work: A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
cites work: On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
cites work: Feasible interior methods using slacks for nonlinear optimization
cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
cites work: Interior Methods for Nonlinear Optimization
cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
cites work: A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
cites work: An augmented Lagrangian interior-point method using directions of negative curvature
cites work: Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
cites work: A globally convergent primal-dual interior-point filter method for nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: An interior algorithm for nonlinear optimization that combines line search and trust region steps
cites work: An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: Lagrange Multipliers and Optimality
cites work: On the Accurate Identification of Active Constraints
cites work: Stability in the presence of degeneracy and error estimation
cites work: Active Set Identification in Nonlinear Programming
cites work: Modifying SQP for Degenerate Problems
cites work: Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
cites work: Discrete Newton's method with local variations for solving large-scale nonlinear systems
cites work: Q4841246
cites work: A More Portable Fortran Random Number Generator
cites work: Numerical solution of saddle point problems
published in: Optimization Methods \& Software
description: scientific article