Newton-raphson Optimization
Newton-Raphson Optimization is an iterative optimization method that belongs to the class of second-order numerical techniques and is distinguished by its use of both the gradient and the Hessian of the objective function to achieve rapid convergence toward a local minimum.
568
Publications
39.5K
Citations
1.4K
Authors
653
Institutions
Publications per year
2017–2026
111
Variants
Newton's Method For OptimizationNewton's Optimization Method
Parents
568
Jianbo Shi, Tomasi · 1994 · 6.9K citations · Full text
Jorge J. Morè, D. C. Sorensen · SIAM Journal on Scientific and Statistical Computing · 1983 · 1.4K citations · Full text
1–5 of 568
1.4K
7
h-index
Universidad Michoacana de San Nicolás de Hidalgo, Mexico
7 publications · 1.2K citations
7
h-index
7
h-index
Johns Hopkins University Applied Physics Laboratory, United States
5 publications · 548 citations
5
h-index
4
h-index
1–5 of 1.4K
653
University of Stuttgart
Stuttgart, Germany
7 h-index
17 publications
751 citations

University of Padua
Padua, Italy
7 h-index
25 publications
1.9K citations

University of Glasgow
Glasgow, United Kingdom
7 h-index
12 publications
1.2K citations

Delft University of Technology
Delft, The Netherlands
6 h-index
8 publications
389 citations
Georgia Institute of Technology
Atlanta, United States
6 h-index
8 publications
380 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
13 publications
462 citations

University of Toronto
Toronto, Canada
5 h-index
11 publications
1.3K citations
University of California San Diego
San Diego, United States
5 h-index
11 publications
994 citations
1–8 of 653
20 publications · 2.5K citations
19
h-index
16 publications · 998 citations
14
h-index
10 publications · 346 citations
10
h-index
9 publications · 667 citations
9
h-index
9 publications · 1.4K citations
9
h-index
1–5