A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems

DOI10.1023/A:1008675917367zbMath1040.90565MaRDI QIDQ1294812

Stefano Lucidi, Gianni Di Pillo, Laura Palagi

Publication date: 1999

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

zbMATH Keywords

linearly constrained optimizationprimal-dual algorithmspenalty-Lagrangian merit function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (3)

Convex programming with single separable constraint and bounded variables ⋮ An exact penalty-Lagrangian approach for large-scale nonlinear programming ⋮ Constraint incorporation in optimization

Uses Software

• LANCELOT
• SNOPT

This page was built for publication: A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems