• TNPACK

  • Referenced in 42 articles [sw00970]
  • large number of variables. Truncated Newton methods allow approximate, rather than exact, solutions ... Conjugate Gradient algorithm (PCG) to solve approximately the Newton equations. The preconditioner M is factored ... this paper we briefly describe the method and provide details for program usage...
  • KELLEY

  • Referenced in 631 articles [sw04829]
  • occupying approximately 100 pages, is devoted to the optimization of smooth functions. The methods studied ... methods discussed in the first part. Chapter 2 studies the local convergence of Newton ... implementation details are discussed. Other quasi-Newton methods are sketched. The last chapter ... first part, chapter 5, studies projection methods for the solution of bound constrained problems...
  • CMA-ES

  • Referenced in 120 articles [sw05063]
  • covariance matrix adaptation (CMA) is a method to update the covariance matrix of this distribution ... approximation of the inverse Hessian matrix in the Quasi-Newton method in classical optimization...
  • SNOPT

  • Referenced in 543 articles [sw02300]
  • scale constrained optimization. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained ... based on a limited-memory quasi-Newton approximation to the Hessian of the Lagrangian...
  • SQPlab

  • Referenced in 175 articles [sw05161]
  • other hand, as a Newton method, the SQP algorithm converges very rapidly, meaning that ... iterations (hence QP solves) to find an approximate solution with a good precision (this...
  • Poblano

  • Referenced in 12 articles [sw04186]
  • stationary point where the gradient is approximately zero. A line search satisfying the strong Wolfe ... optimizers. The optimization methods in Poblano include several nonlinear conjugate gradient methods (Fletcher-Reeves, Polak ... limited-memory quasi-Newton method using BFGS updates to approximate second-order derivative information ... truncated Newton method using finite differences to approximate second-order derivative information...
  • QUIC

  • Referenced in 32 articles [sw11795]
  • QUIC: quadratic approximation for sparse inverse covariance estimation. The ℓ 1 -regularized Gaussian maximum likelihood ... based on Newton’s method and employs a quadratic approximation, but with some modifications that...
  • CVODE

  • Referenced in 62 articles [sw04947]
  • CVODE are variable-order, variable-step multistep methods. For nonstiff problems, CVODE includes the Adams ... formula, the resulting nonlinear system is solved (approximately) at each integration step. For this, CVODE ... Newton iteration. In the cases of a direct linear solver (dense or banded), the Newton ... Krylov method as the linear solver, the iteration is an Inexact Newton iteration, using...
  • GSGPEs

  • Referenced in 11 articles [sw10779]
  • energy functional through a Newton-like method with an approximate line-search strategy...
  • IMRO

  • Referenced in 8 articles [sw20465]
  • present a proximal quasi-Newton method in which the approximation of the Hessian...
  • SDPNAL+

  • Referenced in 53 articles [sw13239]
  • Newton-CG augmented Lagrangian method coupled with a convergent 3-block alternating direction method ... available first order methods based codes: (1) an alternating direction method of multipliers based solver ... method called 2EBD-HPE by R. Monteiro et al. [“A first-order block-decomposition method ... method currently available to solve large scale SDPs arising from rank-1 tensor approximation problems...
  • BTN

  • Referenced in 3 articles [sw00094]
  • Newton method. Truncated-Newton methods obtain the search direction by approximately solving the Newton equations...
  • PROC NLMIXED

  • Referenced in 68 articles [sw11039]
  • maximization; the default is a dual quasi-Newton algorithm. Successful convergence of the optimization problem ... results in parameter estimates along with their approximate standard errors based on the second derivative ... NLMIXED computes their approximate standard errors by using the delta method...
  • GPGCD

  • Referenced in 9 articles [sw06224]
  • GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then ... solved with the so-called modified Newton method, which is a generalization of the gradient...
  • na10

  • Referenced in 50 articles [sw11511]
  • based on Aberth’s method, is presented. The starting approximations are chosen by means ... contained in each annulusA i. As starting approximations we choosek i complex numbers lying ... fori=1,...,q. The computation of Newton’s correction is performed in such...
  • NLEIGS

  • Referenced in 31 articles [sw22547]
  • computational cost comparable to the Newton rational Krylov method but converges more reliably, in particular ... also features low-rank approximation techniques for increased computational efficiency. Small- and large-scale numerical...
  • UCODE

  • Referenced in 5 articles [sw25638]
  • modified Gauss–Newton method. Sensitivities needed for the method are calculated approximately by forward...
  • ANewDsc

  • Referenced in 10 articles [sw19984]
  • roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation ... problem, matching the complexity of Pan’s method for computing all complex roots and improving...
  • Newton

  • Referenced in 6 articles [sw21236]
  • numerical analysis, such as the interval Newton method. Its key conceptual idea is to introduce ... notion of box-consistency, which approximates arc-consistency, a notion well known in artificial intelligence ... cost and generalizes some traditional interval operators. Newton has been applied to numerous applications ... constrained optimization. It is competitive with continuation methods on their equation-solving benchmarks and outperforms...
  • HPGT

  • Referenced in 2 articles [sw41355]
  • accomplished by the Newton-Kantorovich method, using initial approximations that are sufficiently accurate...