An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\mathcal{O}({\epsilon }^{-3/2})$ for Nonconvex Optimization

Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi

An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes $\mathcal{O}({\epsilon }^{-3/2})$ iterations to drive the norm of the gradient of t…