Newton's method

Known as: Newtonian iteration, Newton-Raphson Algorithm, Newton Rhapson 
In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper addresses complementarity problems motivated by constrained optimal control problems. It is shown that the primal-dual… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An inexact Newton method is a generalization ofNewton's method for solving F(x) 0, F n _ _ in, in which, at the kth iteration… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.4
  • table 3.1
  • table 3.2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This expository paper traces the development of the Newton-Raphson method for solving nonlinear algebraic equations through the… (More)
  • figure 1
  • figure 2
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 7
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Inexact Newton methods for finding a zero of F 1 1 are variations of Newton's method in which each step only approximately… (More)
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Newton's method for solving a nonlinear equation of several variables is extended to a nonsmooth case by using the generalized… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We study the numerical performance of a limited memory quasi Newton method for large scale optimization which we call the L BFGS… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The main motivation for this work was the idea that there should exist an easily understood polynomial time algorithm for linear… (More)
Is this relevant?