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

DOI10.1007/s10589-009-9271-4zbMath1190.90205OpenAlexW2093112915MaRDI QIDQ975359

André L. M. Martinez, José Mario Martínez, Emerson Vitor Castelani, Benar Fux 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)

Related Items

Sequential equality-constrained optimization for nonlinear programming, 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, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, Outer trust-region method for constrained optimization, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Cites Work

• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• Multiplier and gradient methods
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Numerical Optimization
• Trust Region Methods
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item