• CONOPT

  • Referenced in 147 articles [sw02791]
  • factorizations, search directions, line-searches, and Newton iterations. The paper contains performance statistics...
  • NITSOL

  • Referenced in 83 articles [sw00623]
  • introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems...
  • CVODE

  • Referenced in 44 articles [sw04947]
  • nonstiff systems, and various versions of Newton iteration. In the cases of a direct linear ... solver (dense or banded), the Newton iteration is a Modified Newton iteration, in that ... solver, the iteration is an Inexact Newton iteration, using the current Jacobian (through matrix-free...
  • tn

  • Referenced in 110 articles [sw05140]
  • exploited to define a modified Newton method which can be applied to problems that ... modified Lanczos algorithm requires up to n iterations to compute the search direction, where ... problem. The idea of a truncated Newton method ... terminate the iterations earlier. A preconditioned truncated Newton method is described that defines a search...
  • KELLEY

  • Referenced in 554 articles [sw04829]
  • Iterative methods for optimization This book gives an introduction to optimization methods for unconstrained ... Chapter 2 studies the local convergence of Newton’s method, inexact Newton methods ... Gauss-Newton method for the solution of nonlinear least squares problems. Both, overdetermined and underdetermined ... that the starting point of the optimization iteration is sufficiently close to a solution...
  • GQTPAR

  • Referenced in 282 articles [sw07451]
  • iterations. We also consider the use of this algorithm in a trust region Newton ... under reasonable assumptions the sequence generated by Newton’s method has a limit point which ... call to GQTPAR only required 1.6 iterations on the average...
  • MIRKDC

  • Referenced in 34 articles [sw07159]
  • discusses several implementation issues (modified Newton iteration, use of defect control instead of the standard...
  • SQPlab

  • Referenced in 113 articles [sw05161]
  • Newton approach applied to the optimality conditions of the optimization problem. Each iteration ... Newton method, the SQP algorithm converges very rapidly, meaning that it requires few iterations (hence...
  • alphaCertified

  • Referenced in 29 articles [sw07351]
  • Newton’s method to certify that Newton iterations will converge quadratically to solutions...
  • Algorithm 840

  • Referenced in 20 articles [sw04463]
  • weights are found simultaneously through a Newton iteration. For large $N$ and $c$, the iteration...
  • SMCSolver

  • Referenced in 15 articles [sw15194]
  • IS.m), Logarithmic Reduction (QBD_LR.m), Newton Iterations (QBD_NI.m), etc. The steady state vector...
  • ALCON

  • Referenced in 34 articles [sw05315]
  • particular, for the corrector iteration the Gauss-Newton method is used where the QR-factorization...
  • ParalleloGAM

  • Referenced in 8 articles [sw01571]
  • linear system resulting from the Newton iteration is factored (block diagonal) and solved...
  • TFETI

  • Referenced in 7 articles [sw20642]
  • Corresponding linearized problems arising in the Newton iterations are solved in parallel by the above ... local quadratic convergence of the semismooth Newton method is observed...
  • FLICA-4

  • Referenced in 7 articles [sw09187]
  • NASA TM-89464], together with a Newton iterative method. We also present here some improvements...
  • ELF

  • Referenced in 10 articles [sw10280]
  • codes are based on a Newton-Raphson iteration over the monotonic function...
  • GNOME

  • Referenced in 10 articles [sw10281]
  • codes are based on a Newton-Raphson iteration over the monotonic function...
  • QPBOX

  • Referenced in 6 articles [sw04799]
  • definite matrix, and is solved by Newton iteration with line search. The paper describes...
  • KADATH

  • Referenced in 9 articles [sw09575]
  • resulting system is solved using a Newton-Raphson iteration. Doing so, KADATH is able...
  • TRON

  • Referenced in 100 articles [sw04714]
  • TRON is a trust region Newton method for the solution of large bound-constrained optimization ... generating a small number of minor iterates, even for problems with a large number...