• L-BFGS

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

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

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

  • Referenced in 110 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...
  • NLopt

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

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

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

  • Referenced in 7 articles [sw36962]
  • free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous ... direct-search derivative-free Matlab optimizer for bound-constrained problems is described, whose remarkable features ... compares favorable with that of NOMAD (Nonsmooth Optimization by Mesh Adaptive Direct Search), a well...
  • TAO

  • Referenced in 44 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...
  • DFN

  • Referenced in 18 articles [sw36998]
  • linesearch-based methods for nonsmooth constrained optimization problems when first-order information on the problem ... describe a general framework for bound-constrained problems and analyze its convergence toward stationary points ... second part, we consider inequality constrained optimization problems where both objective function and constraints ... problem can be reformulated as the bound-constrained minimization of the proposed exact penalty function...
  • SNOBFIT

  • Referenced in 20 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...
  • MSO

  • Referenced in 4 articles [sw35041]
  • framework for bound-constrained black-box global optimization algorithms. This paper addresses a class ... algorithms for solving bound-constrained black-box global optimization problems. These algorithms partition the objective...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • solving low-dimensional bound-constrained black box global optimization problems. The method starts by forming...
  • 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...
  • libcgrpp

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

  • Referenced in 15 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...
  • libbrkga

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

  • Referenced in 1 article [sw32721]
  • BOBYQA: Derivative-Free Optimizer for Bound-Constrained Minimization. Py-BOBYQA is a flexible package...
  • TESTINT

  • Referenced in 1 article [sw36991]
  • inequality constrained plus 61 bound constrained test problems for black-box integer programming. Publication ... nonmonotone line searches for black-box optimization problems with integer variables. In this paper ... algorithm that tackles problems with only bound constraints on the variables. Then, we combine ... test bed of both bound-constrained and generally-constrained problems. We show the effectiveness...
  • KNITRO

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