Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians

DOI10.1007/S10589-009-9271-4MaRDI QIDQ975359zbMATH OpenOpenAlexFDO

Authors André L. M. Martinez, Emerson V. Castelani, J. M. Martínez, B. F. Svaiter

Publication date 9 June 2010

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-009-9271-4

zbMATH Keywords

regularizationnonlinear programmingaugmented Lagrangian methodgreediness

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
• scientific article; zbMATH DE number 4092678
• scientific article; zbMATH DE number 1552021
• Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Multiplier and gradient methods
• Numerical Optimization
• 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
• Trust Region Methods

Cited in

(7)

• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
• Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
• A new sequential optimality condition for constrained nonsmooth optimization
• Sequential equality-constrained optimization for nonlinear programming
• Outer trust-region method for constrained optimization
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
• On the minimization of possibly discontinuous functions by means of pointwise approximations

This page was built for publication: Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975359)