Critical Point Finding with Newton-MR by Analogy to Computing Square Roots

P. Wolfe, “Convergence conditions for ascent methods,” SIAM Review

1969

Earlier work this paper cites.

J. W. McIver and A. Komornicki, “Structure of transition states in organic reactions. general theory and an application to the cyclobutene-butadiene isomerization using a semiempirical molecular orbital method,” Journal of the American Chemical Society

1972

Earlier work this paper cites.

P. Baldi and K. Hornik, “Neural networks and principal component analysis: Learning from examples without local minima,” Neural Networks

1989

Earlier work this paper cites.

B. A. Pearlmutter, “Fast exact multiplication by the Hessian,” Neural Computation

1994

Earlier work this paper cites.

E. Brown, “Square roots from 1; 24, 51, 10 to dan shanks,” The College Mathematics Journal

1999

Earlier work this paper cites.

L. Angelani, R. D. Leonardo, G. Ruocco, A. Scala, and F. Sciortino, “Saddles in the energy landscape probed by supercooled liquids,” Physical Review Letters

2000

Earlier work this paper cites.

J. P. K. Doye and D. J. Wales, “Saddle points and dynamics of Lennard-Jones clusters, solids, and supercooled liquids,” The Journal of Chemical Physics

2002

Cited alongside, same era.

New York, NY, USA: Cambridge University Press, 2004

S. Boyd and L. Vandenberghe, Convex Optimization · 2004

Cited alongside, same era.

Springer US, 2004

Y. Nesterov, Introductory Lectures on Convex Optimization · 2004

Cited alongside, same era.

S.-C. T. Choi, C. C. Paige, and M. A. Saunders, “MINRES-QLP: A Krylov subspace method for indefinite or singular symmetric systems,” SIAM Journal on Scientific Computing

2011

Cited alongside, same era.

Y. Dauphin, R. Pascanu, Ç. Gülçehre, K. Cho, S. Ganguli, and Y. Bengio, “Identifying and attacking the saddle point problem in high-dimensional non-convex optimization,” CoRR

Original

2014

Cited alongside, same era.

J. Pennington and Y. Bahri, “Geometry of neural network loss surfaces via random matrix theory,” in International Conference on Learning Representations (ICLR)

2017

Later among the works it cites.

F. Roosta, Y. Liu, P. Xu, and M. W. Mahoney, “Newton-MR: Newton’s method without smoothness or convexity,” arXiv preprint arXiv:1810.00303

Original

2018

Later among the works it cites.

C. G. Frye, N. S. Wadia, M. R. DeWeese, and K. E. Bouchard, “Numerically recovering the critical points of a deep linear autoencoder,” 2019

2019

Closest in time.

D. Harvey and J. Van Der Hoeven, “Integer multiplication in time O(n log n).” Mar. 2019

2019

Closest in time.

Visited on June 10, 2019

E. W. Weisstein, “Moore-penrose matrix inverse. From MathWorld—A Wolfram Web Resource.” · 2019

Closest in time.