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

@article{Morales2011RemarkO,
  title={Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”},
  author={Jos{\'e} Luis Morales and Jorge Nocedal},
  journal={ACM Trans. Math. Softw.},
  year={2011},
  volume={38},
  pages={7:1-7:4},
  url={https://api.semanticscholar.org/CorpusID:16742561}
}
  • J. MoralesJ. Nocedal
  • Published in TOMS 1 November 2011
  • Mathematics, Computer Science
  • ACM Trans. Math. Softw.
It is shown that the performance of the algorithm can be improved significantly by making a relatively simple modification to the subspace minimization phase.
View on ACM
doi.org
433 Citations
Highly Influential Citations
30
Background Citations
26
Methods Citations
164

Figures from this paper

433 Citations

BiqCrunch

BaqCrunch is a branch-and-bound method that uses an original, efficient semidefinite-optimization-based bounding procedure that has been successfully tested on a variety of well-known combinatorial optimization problems, such as Max-Cut, Max-k-Cluster, and Max-Independent-Set.

Techniques for Solving Bound-Constrained Convex Optimization Using Spectral Projected Conjugate Gradient Based on Barzilai-Borwein Step Length

This work aims to create an effective spectral conjugate gradient for non-linear optimization problems and to project the solution into a bounded convex set for largescale optimization problems. We…

A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization

A new line search, designed to tolerate errors, guarantees that the Armijo-Wolfe conditions are satisfied under most reasonable conditions, and works in conjunction with the lengthening procedure, which is shown to enjoy convergence guarantees for strongly convex functions.

A quasi-Newton proximal splitting method

Efficient implementations of the proximity calculation for a useful class of functions are described and an elegant quasi-Newton method is applied to acceleration of convex minimization problems, and compares favorably against state-of-the-art alternatives.

Improved semidefinite branch-and-bound algorithm for k-cluster

A generic branch-and-bound method featuring an improved semidefinite bounding procedure that outperforms the best known methods in both time and ability to solve large instances of k-cluster problems.

LMBOPT – a limited memory method for bound-constrained optimization

This paper compares LMBOPT and many other solvers on the unconstrained and bound constrained problems from the CUTEst collection and makes recommendations on which solver to use and when.

PNKH-B: A Projected Newton-Krylov Method for Large-Scale Bound-Constrained Optimization

It is shown that the consistent use of the Hessian metric in PNKH-B leads to fast convergence, particularly in the first few iterations, using three numerical experiments motivated by parameter estimation, machine learning, and image reconstruction.

Parallel L-BFGS-B algorithm on GPU

A first-order multigrid method for bound-constrained convex optimization

A smoothing operator that only uses first-order information is proposed that will avoid computation of second derivatives of the objective function, thus excluding Newton-like methods.

Solving 0-1 quadratic problems with two-level parallelization of the BiqCrunch solver

This paper presents MLTBiqCrunch, a hierarchically parallelized version of the open-source solver BiqCrunch, which has two levels of parallelization: a coarse grain, assigning a thread to a node evaluation and a fine grain, parallelizing a nodes evaluation when some threads are not busy.
...

9 References

Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization

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…

A Limited Memory Algorithm for Bound Constrained Optimization

An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the…

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

GALAHAD, a library of Fortran 90 packages for large-scale nonlinear optimization, particularly addresses quadratic programming problems, containing both interior point and active set algorithms, as well as tools for preprocessing problems prior to solution.

Newton's Method for Large Bound-Constrained Optimization Problems

A trust region version of Newton's method for bound-constrained problems that holds for linearly constrained problems and yields global and superlinear convergence without assuming either strict complementarity or linear independence of the active constraints.

CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

A new version of CUTE, now known as CUTEr, is presented, which includes reorganisation of the environment to allow simultaneous multi-platform installation, new tools for, and interfaces to, optimization packages, and a considerably simplified and entirely automated installation procedure for unix systems.

AMPL: A Modeling Language for Mathematical Programming

An efficient translator is implemented that takes as input a linear AMPL model and associated data, and produces output suitable for standard linear programming optimizers.