Augmented Lagrangian methods for nonlinear programming with possible infeasibility
type: Item
instance of: scholarly article
title: Augmented Lagrangian methods for nonlinear programming with possible infeasibility
zbMATH Open document ID: 1353.90117
author: M. L. N. Gonçalves
author: J. G. Melo
author: L. F. Prudente
published in: Journal of Global Optimization
publication date: 2015-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6496852
zbMATH Keywords: global optimization
zbMATH Keywords: augmented Lagrangians
zbMATH Keywords: nonlinear programming
zbMATH Keywords: infeasibility
describes a project that uses: LANCELOT
describes a project that uses: Ipopt
describes a project that uses: INTLIB
MaRDI profile type: Publication
full work available at URL: s10898-015-0289-0
OpenAlex ID: W1967695340
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Q3690580
cites work: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
cites work: Optimality properties of an augmented Lagrangian method on infeasible problems
cites work: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
cites work: A primal dual modified subgradient algorithm with sharp Lagrangian
cites work: Infeasibility Detection and SQP Methods for Nonlinear Optimization
cites work: Q4023146
cites work: Primal-dual nonlinear rescaling method with dynamic scaling parameter update
cites work: Multiplier and gradient methods
cites work: Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
cites work: Combined Primal–Dual and Penalty Methods for Convex Programming
cites work: On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
cites work: Unconstrained Lagrangians in Nonlinear Programming
cites work: Handling infeasibility in a large-scale nonlinear optimization algorithm
cites work: The kissing number in four dimensions
cites work: Modified barrier functions (theory and methods)
cites work: Primal-dual nonlinear rescaling method for convex optimization
cites work: Q5590418
cites work: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
cites work: Lagrange-type functions in constrained non-convex optimization.
cites work: Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes
cites work: Das Problem der dreizehn Kugeln
cites work: Unified theory of augmented Lagrangian methods for constrained global optimization
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S10898-015-0289-0
Recommended article: Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
Recommended article: Optimality properties of an augmented Lagrangian method on infeasible problems
Recommended article: Augmented Lagrangian method with alternating constraints for nonlinear optimization problems
Recommended article: An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
Recommended article: Q5480813
Recommended article: Augmented Lagrangian methods for variational inequality problems
Recommended article: Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
Recommended article: Augmented Lagrangian algorithms for linear programming
Recommended article: Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming
Recommended article: Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
description: scientific article; zbMATH DE number 6496852