• # tn

• Referenced in 140 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 71 articles [sw11666]
• solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value...
• # ve08

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

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

• Referenced in 8 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...
• # UOBYQA

• Referenced in 69 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...
• # 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...
• # 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...
• # 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...
• # CTA

• Referenced in 2 articles [sw09373]
• Hessian factorization in curved trajectories for unconstrained minimization. A curved trajectories algorithm ... package for the minimization of unconstrained functions of several variables with intervals on the variables ... package compares very favourably with other minimization packages using a sample of large CUTEr problems...