ACM Transactions on Mathematical Software · 1997 · 3.4K citations · 13 references
ComputingComputer ScienceAlgorithmsOptimizationScientific ComputingGradient-based OptimizationHeuristic OptimizationLarge-scale OptimizationNonlinear ProgrammingNumerical AlgorithmsNumerical AnalysisHessian ApproximationL-bfgs OptimizationLarge-scale Nonlinear ProgrammingLarge-scale Sparse OptimizationOptimization Algorithms
L-BFGS-B is a limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds on the variables. It is intended for problems in which information on the Hessian matrix is difficult to obtain, or for large dense problems. L-BFGS-B can also be used for unconstrained problems and in this case performs similarly to its predessor, algorithm L-BFGS (Harwell routine VA15). The algorithm is implemented in Fortran 77.
13
A Limited Memory Algorithm for Bound Constrained Optimization
Richard H. Byrd, Peihuang Lu, Jorge Nocedal et al. · SIAM Journal on Scientific Computing · 1995 · 6.2K citations
Constrained minimization methods
E. S. Levitin, B. T. Polyak · USSR Computational Mathematics and Mathematical Physics · 1966 · 852 citations