Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”

Source abstract

This remark describes an improvement and a correction to Algorithm 778. It is shown that the performance of the algorithm can be improved significantly by making a relatively simple modification to the subspace minimization phase. The correction concerns an error caused by the use of routine dpmeps to estimate machine precision.