An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables

DOI10.1137/S1052623494276518zbMath0915.65060MaRDI QIDQ4389204

Radosław Pytlak

Publication date: 12 May 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

convergencenumerical resultsbox constraintsconjugate gradient algorithmlarge-scale nonlinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (4)

A Family of Supermemory Gradient Projection Methods for Constrained Optimization ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ On the method of shortest residuals for unconstrained optimization ⋮ Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints

Uses Software

• LANCELOT
• L-BFGS-B
• L-BFGS

This page was built for publication: An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables