• SNOPT

  • Referenced in 524 articles [sw02300]
  • scale constrained optimization. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained ... solver. It is based on a limited-memory quasi-Newton approximation to the Hessian...
  • Poblano

  • Referenced in 11 articles [sw04186]
  • Polak-Ribiere, Hestenes-Stiefel), a limited-memory quasi-Newton method using BFGS updates to approximate...
  • libROM

  • Referenced in 12 articles [sw34791]
  • based ROMs using the discrete empirical interpolation method (DEIM). The original libROM release was written ... Limited-memory adaptive snapshot selection for proper orthogonal decomposition, International Journal of Numerical Methods...
  • LSA

  • Referenced in 4 articles [sw22887]
  • optimization problems, are based on limited-memory variable metric methods. Subroutine PNET, also intended...
  • MSS

  • Referenced in 6 articles [sw08530]
  • method computes the minimizer of a quadratic function defined by a limited-memory BFGS matrix ... adaptation of the Moré-Sorensen direct method into an L-BFGS setting for large-scale...
  • Algorithm 734

  • Referenced in 3 articles [sw04692]
  • Buckley-LeNir method, Nocedal’s limited memory algorithm, and an experimental limited-memory implementation...
  • libLBFGS

  • Referenced in 2 articles [sw33308]
  • implementation of Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method written by Jorge Nocedal...
  • PREQN

  • Referenced in 9 articles [sw01233]
  • automatically generating preconditioners for the conjugate gradient method. It is designed for solving a sequence ... optimization. The preconditioners are based on limited-memory quasi-Newton updating and are recommended...
  • BLITZ

  • Referenced in 5 articles [sw37121]
  • progress toward convergence. This result motivates methods for optimizing algorithmic parameters and discarding irrelevant variables ... convincingly outperforms existing solvers in sequential, limited-memory, and distributed settings. BLITZ is not specific...
  • CUTE

  • Referenced in 64 articles [sw00177]
  • CUTE: a concolic unit testing engine for C...
  • HSL

  • Referenced in 274 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • KNITRO

  • Referenced in 180 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 304 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1648 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LSQR

  • Referenced in 372 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • MA57

  • Referenced in 88 articles [sw00536]
  • MA57 - a code for the solution of sparse...
  • Matlab

  • Referenced in 12557 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • NITSOL

  • Referenced in 93 articles [sw00623]
  • We introduce a well-developed Newton iterative (truncated...
  • ODRPACK

  • Referenced in 21 articles [sw00649]
  • ODRPACK is a software package for weighted orthogonal...
  • TNPACK

  • Referenced in 42 articles [sw00970]
  • We present a FORTRAN package of subprograms for...