A limited memory algorithm for bound constrained optimization
SIAM Journal on Scientific Computing
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
ACM Transactions on Mathematical Software (TOMS)
Newton's Method for Large Bound-Constrained Optimization Problems
SIAM Journal on Optimization
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
ACM Transactions on Mathematical Software (TOMS)
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
ACM Transactions on Mathematical Software (TOMS)
Evaluating bound-constrained minimization software
Computational Optimization and Applications
Picture tags and world knowledge: learning tag relations from visual semantic sources
Proceedings of the 21st ACM international conference on Multimedia
Three-dimensional reconstruction using multiresolution photoclinometry by deformation
The Visual Computer: International Journal of Computer Graphics
An efficient construction of reduced deformable objects
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
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.