Newton-Kantorovich Method and Its Global Convergence
By Boris Polyak. 2006
50 citations recorded by the source corpus.
Subfields: Mathematical Physics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/5f7092c7794209cee4dbaeba517067b89b962c3f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Mathematical Physics
In Numerical Analysis
- Sebastian U. Stich
- Martin Jaggi
- Sai Praneeth Karimireddy
- Guanghui Lan
- Sebastian Pokutta
- Alejandro Carderera
- Simon Lacoste-Julien
- Elad Hazan
Citations in the corpus
- Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients (2018, background): “Otherwise, global convergence results of secondorder algorithms were known when f(x) has both strong-convexity and Lipschitz gradients ([22, 28]), or by solving cubic subproblems ([9, 24, 27]).”