• CG_DESCENT

  • Referenced in 124 articles [sw04813]
  • comparisons with other methods for large-scale unconstrained optimization are given...
  • L-BFGS

  • Referenced in 759 articles [sw03229]
  • BFGS-B Fortran subroutines for large-scale bound-constrained optimization. L-BFGS ... limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds ... large dense problems. L-BFGS-B can also be used for unconstrained problems...
  • LBFGS-B

  • Referenced in 351 articles [sw05142]
  • BFGS-B Fortran subroutines for large-scale bound-constrained optimization L-BFGS ... limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds ... large dense problems. L-BFGS-B can also be used for unconstrained problems...
  • CG+

  • Referenced in 15 articles [sw05285]
  • Software for Large-scale Unconstrained Optimization CG+ is a Conjugate Gradient code for solving large...
  • CUTE

  • Referenced in 222 articles [sw14681]
  • CUTE: Constrained and unconstrained testing environment. The purpose of this article is to discuss ... environment for testing small- and large-scale nonlinear optimization algorithms. Although many of these facilities...
  • L-BFGS-B

  • Referenced in 179 articles [sw01234]
  • BFGS-B Fortran subroutines for large-scale bound-constrained optimization. L-BFGS ... limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds ... large dense problems. L-BFGS-B can also be used for unconstrained problems...
  • NLopt

  • Referenced in 93 articles [sw11789]
  • changing one parameter. Support for large-scale optimization (some algorithms scalable to millions of parameters ... thousands of constraints). Both global and local optimization algorithms. Algorithms using function values only (derivative ... algorithms exploiting user-supplied gradients. Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear...
  • LSA

  • Referenced in 4 articles [sw22887]
  • basic Fortran subroutines for large-scale unconstrained and box constrained optimization and large-scale systems...
  • Poblano

  • Referenced in 11 articles [sw04186]
  • Matlab toolbox of large-scale algorithms for unconstrained nonlinear optimization problems. The algorithms in Poblano...
  • OSGA

  • Referenced in 5 articles [sw16542]
  • User’s Manual for OSGA (Optimal SubGradient Algorithm). This document provides a user’s guide ... solving large-scale unconstrained, bound-constrained, and simply constrained convex optimization...
  • TMAC

  • Referenced in 3 articles [sw15565]
  • modern methods for large-scale optimization. It covers a variety of optimization problems, which ... nonconvex, as well as constrained and unconstrained. The algorithms implemented in TMAC, such...
  • SPENBAR

  • Referenced in 1 article [sw08452]
  • modified penalty algorithm for solving large-scale nonlinear programming problems. It uses only one-dimensional ... into a sequence of unconstrained minimization subproblems. The unconstrained optimization problems are solved by means...
  • ADOL-C

  • Referenced in 244 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • BBVSCG

  • Referenced in 6 articles [sw00069]
  • BBVSCG - A variable-storage algorithm for function minimization...
  • Bi-CG

  • Referenced in 34 articles [sw00076]
  • Bi-CG: An effective solver for three fields...
  • CSDP

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • CUTE

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

  • Referenced in 36 articles [sw00357]
  • GLOB -- a new VNS-based software for global...
  • HSL

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

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