Article · Wikipedia archive · Last revised Jun 12, 2026

NLPQLP

The Fortran subroutine NLPQLP, a newer version of NLPQL, solves smooth nonlinear programming problems by a sequential quadratic programming (SQP) algorithm. The new version is specifically tuned to run under distributed systems. In case of computational errors, such as inaccurate function or gradient evaluations, a non-monotone line search is activated. The code is easily transformed to C by f2c and is widely used in academia and industry.

Last revised
Jun 12, 2026
Read time
≈ 1 min
Length
93 w
Citations
Source

The Fortran subroutine NLPQLP, a newer version of NLPQL, solves smooth nonlinear programming problems by a sequential quadratic programming (SQP) algorithm. The new version is specifically tuned to run under distributed systems. In case of computational errors, such as inaccurate function or gradient evaluations, a non-monotone line search is activated. The code is easily transformed to C by f2c and is widely used in academia and industry.

References

References

External links