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, caused for example by 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

Schittkowski, Klaus (2014), "NLPQLP: A Fortran Implementation of a Sequential Quadratic Programming Algorithm with Distributed and Non-Monotone Line Search", Report

External links

http://www.klaus-schittkowski.de//nlpqlp.htm

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.