• L-BFGS

  • Referenced in 619 articles [sw03229]
  • Fortran subroutines for large-scale bound-constrained optimization. L-BFGS-B is a limited-memory...
  • LBFGS-B

  • Referenced in 233 articles [sw05142]
  • Fortran subroutines for large-scale bound-constrained optimization L-BFGS-B is a limited-memory...
  • TRON

  • Referenced in 100 articles [sw04714]
  • method for the solution of large bound-constrained optimization problems. TRON uses a gradient projection ... remarkably efficient at solving large bound-constrained optimization problems...
  • L-BFGS-B

  • Referenced in 133 articles [sw01234]
  • Fortran subroutines for large-scale bound-constrained optimization. L-BFGS-B is a limited-memory...
  • NLopt

  • Referenced in 57 articles [sw11789]
  • user-supplied gradients. Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints...
  • IMFIL

  • Referenced in 26 articles [sw04814]
  • filtering is a way to solve bound-constrained optimization problems for which derivative information...
  • APPSPACK

  • Referenced in 25 articles [sw04400]
  • software for solving unconstrained and bound-constrained optimization problems. It implements an asynchronous parallel pattern...
  • TAO

  • Referenced in 34 articles [sw10597]
  • algorithms for the solution of large optimization problems on high-performance parallel architectures. Our case ... projection, conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation ... GPCG algorithm within the Toolkit for Advanced Optimization (TAO) is available for a wide range...
  • SNOBFIT

  • Referenced in 16 articles [sw05289]
  • practical applications, for which most other optimization routines are ill-prepared. Soft constraints are taken ... SNOBFIT, one needs the MINQ bound-constrained quadratic programming package...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • solving low-dimensional bound-constrained black box global optimization problems. The method starts by forming...
  • OSGA

  • Referenced in 4 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...
  • libcgrpp

  • Referenced in 2 articles [sw07205]
  • Python/C library for bound-constrained global optimization with continuous GRASP. This paper describes libcgrpp...
  • libbrkga

  • Referenced in 1 article [sw13245]
  • Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm. This...
  • TRESNEI

  • Referenced in 13 articles [sw05208]
  • trust-region Gauss-Newton method for bound-constrained nonlinear least-squares problems is presented ... numerical comparison with functions from the Matlab Optimization Toolbox is carried...
  • KNITRO

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

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

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

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

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

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