The NLPU solver implements large-scale limited-memory Broyden-Fletcher-Goldfarb-Shanno algorithms (recursive and matrix forms). The matrix form is used for bound-constrained optimization, and the recursive loop is used for unconstrained optimization.

The recursive Hessian matrix update is as follows:

The compact matrix update is as follows: