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

DOI10.1080/10556780008805793zbMath0988.90037OpenAlexW2029117578MaRDI QIDQ4521379

Stefano Lucidi, Laura Palagi, Gianni Di Pillo

Publication date: 16 July 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear programmingbound constraintsprimal-dual algorithms

Mathematics Subject Classification ID

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

Related Items

An augmented Lagrangian method exploiting an active-set strategy and second-order information, An exact penalty-Lagrangian approach for large-scale nonlinear programming, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems