A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables

DOI10.1080/10556780008805793MaRDI QIDQ4521379zbMATH OpenOpenAlexFDO

Authors Stefano Lucidi, L. Palagi, Gianni Di Pillo

Publication date 16 July 2002

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780008805793

zbMATH Keywords

bound constraintsnonlinear programmingprimal-dual algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
• Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization

Cited in

(6)

• A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
• An augmented Lagrangian method exploiting an active-set strategy and second-order information
• An exact penalty-Lagrangian approach for large-scale nonlinear programming
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
• Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems

This page was built for publication: A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables

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