• KELLEY

  • Referenced in 554 articles [sw04829]
  • introduction to optimization methods for unconstrained and bound constrained minimization problems. The style...
  • fminsearch

  • Referenced in 199 articles [sw07467]
  • popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical...
  • tn

  • Referenced in 110 articles [sw05140]
  • Newton-type minimization via the Lanczos method This paper discusses the use of the linear ... solution of large-scale unconstrained minimization problems. It is shown how the equivalent Lanczos characterization...
  • NAPACK

  • Referenced in 68 articles [sw11666]
  • solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value...
  • Algorithm 500

  • Referenced in 60 articles [sw05275]
  • Algorithm 500: Minimization of Unconstrained Multivariate Functions...
  • Algorithm 611

  • Referenced in 32 articles [sw05276]
  • Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach...
  • CONMIN

  • Referenced in 50 articles [sw04741]
  • efficient solution of constrained problems, unconstrained function minimization problems may also be solved...
  • ve08

  • Referenced in 131 articles [sw05141]
  • unconstrained optimization of partially separable functions We consider the problem of minimizing a smooth objective...
  • HANSO

  • Referenced in 9 articles [sw05271]
  • gradient sampling methods. For general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS...
  • Algorithm 738

  • Referenced in 6 articles [sw08077]
  • software package for finding the unconstrained minimizer of a nonlinear function of n variables ... between a recently developed “tensor method” for unconstrained optimization and an analogous standard method based...
  • QSPLINE

  • Referenced in 4 articles [sw07307]
  • constraints can be reformulated as an unconstrained minimization problem with a convex quadratic spline ... quadratic programming problem, in which various unconstrained minimization algorithms can be used to find...
  • ADS

  • Referenced in 4 articles [sw13387]
  • FORTRAN program for nonlinear constrained (or unconstrained) function minimization. The optimization process is segmented into ... method, using the BFGS variable metric unconstrained minimization together with polynomial interpolation...
  • GUSTAF

  • Referenced in 4 articles [sw18113]
  • problem by solving a series of unconstrained minimization problems. Program options include a line-printer...
  • SpeeDP

  • Referenced in 4 articles [sw07003]
  • rank semidefinite programming (LRSDP) relaxations of unconstrained ${-1,1}$ quadratic problems (or, equivalently ... convex nonlinear programming problem of minimizing a quadratic function subject to separable quadratic equality constraints ... LRSDP problem with the unconstrained minimization of a new merit function and we define...
  • UOBYQA

  • Referenced in 52 articles [sw07576]
  • quadratic approximation A new algorithm for general unconstrained optimization calculations is described. It takes account ... vector of variables either by minimizing the quadratic model subject to a trust region bound...
  • Algorithm 739

  • Referenced in 4 articles [sw04404]
  • software package for finding the unconstrained minimizer of a nonlinear function of $n$ variables ... between a recently developed “tensor method” for unconstrained optimization and an analogous standard method based...
  • BBVSCG

  • Referenced in 6 articles [sw00069]
  • Shanno} and {it K. H. Phua} [Minimization of unconstrained multivariate functions, ibid...
  • UCMINF

  • Referenced in 3 articles [sw05279]
  • Fortran subroutines for finding an unconstrained minimizer of a general function, whose gradient is available...
  • CXFTV2

  • Referenced in 3 articles [sw00180]
  • each active set calculation to an unconstrained minimization with fewer variables that requires only...
  • QPBOX

  • Referenced in 6 articles [sw04799]
  • dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower...