Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming

DOI10.1023/A:1011276420546zbMath0979.65050OpenAlexW2141495966MaRDI QIDQ5939946

L. S. Lasdon, Ravindra S. Gajulapalli

Publication date: 10 February 2002

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

Full work available at URL: https://doi.org/10.1023/a:1011276420546

zbMATH Keywords

numerical examplesnonlinear programmingbarrier algorithmcomputational experiencelarge sparse problemsprimal-dual interior point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Stochastic programming (90C15) Interior-point methods (90C51)

Uses Software

• CONOPT
• GAMS
• MA47

This page was built for publication: Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming