• ve08

  • Referenced in 148 articles [sw05141]
  • functions We consider the problem of minimizing a smooth objective function f of n real ... storage and computing time by using a minimization algorithm that exploits some special structure...
  • NPSOL

  • Referenced in 147 articles [sw07420]
  • Fortran 77 subroutines for minimizing a smooth function subject to constraints, which may include simple...
  • ALGENCAN

  • Referenced in 117 articles [sw05160]
  • ALGENCAN) is a Fortran code for minimizing a smooth function with a potentially large number...
  • UNCMND

  • Referenced in 106 articles [sw05265]
  • NCMND minimizes a smooth nonlinear function of n variables. A subroutine that computes the function...
  • KELLEY

  • Referenced in 631 articles [sw04829]
  • optimization methods for unconstrained and bound constrained minimization problems. The style of the book ... pages, is devoted to the optimization of smooth functions. The methods studied in this first ... such cases the noise often introduces artificial minimizers. Gradient information, even if available, cannot expected ... treatment of both, optimization methods for smooth and for noisy functions is a unique feature...
  • DSPCA

  • Referenced in 35 articles [sw04804]
  • problem. We also discuss Nesterov’s smooth minimization technique applied to the SDP arising...
  • FPC_AS

  • Referenced in 68 articles [sw12218]
  • problem, which involves the minimization of a smaller and smooth quadratic function, is solved...
  • SolvOpt

  • Referenced in 50 articles [sw04332]
  • concerned with minimization or maximization of nonlinear, possibly non-smooth objective functions and solution...
  • CFSQP

  • Referenced in 61 articles [sw04658]
  • functions for the minimization of the maximum of a set of smooth objective functions (possibly...
  • SpicyMKL

  • Referenced in 9 articles [sw14765]
  • regularization. The proposed SpicyMKL iteratively solves smooth minimization problems. Thus, there is no need...
  • HANSO

  • Referenced in 18 articles [sw05271]
  • HANSO: Hybrid Algorithm for Non-Smooth Optimization A MATLAB package based on the BFGS ... sampling methods. For general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS, limited...
  • NESUN

  • Referenced in 43 articles [sw28733]
  • minimization. They do not need to know in advance the actual level of smoothness...
  • alabama

  • Referenced in 15 articles [sw09332]
  • optimization. Augmented Lagrangian Adaptive Barrier Minimization Algorithm for optimizing smooth nonlinear objective functions with constraints...
  • SDPEN

  • Referenced in 21 articles [sw05152]
  • problem of minimizing a continuously differentiable function of several variables subject to smooth nonlinear constraints ... neither calculated nor explicitly approximated. Hence, every minimization procedure must use only a suitable sampling...
  • Finito

  • Referenced in 18 articles [sw38276]
  • have shown that smooth strongly convex finite sums can be minimized faster than by treating...
  • CUBGCV

  • Referenced in 8 articles [sw04346]
  • points, with the degree of smoothing chosen to minimize the expected mean square error ... with the data is known, or, to minimize the generalized cross validation (GCV) when ... matrices associated with the cubic smoothing spline problem. Bayesian point error estimates are also calculated...
  • PNOPT

  • Referenced in 2 articles [sw20469]
  • generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex ... functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show ... behavior of Newton-type methods for minimizing smooth functions, even when search directions are computed...
  • NESTA

  • Referenced in 131 articles [sw06576]
  • already quite immense. This paper applies a smoothing technique and an accelerated first-order algorithm ... fewer alternatives, such as total-variation minimization and convex programs seeking to minimize...
  • SNLSDP

  • Referenced in 38 articles [sw05127]
  • relaxation (with regularization) of the non-convex minimization problem (1), and use the SDP computed ... with backtracking line search to solve the smooth unconstrained problem (2). This software package...
  • ClusterKDE

  • Referenced in 4 articles [sw36221]
  • cluster is obtained by minimizing a smooth kernel function. Although in our applications we have...