You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Our method is the first variant of Newton’s method [for convex objects with Lipschitz Hessian] that has both cheap iterations [line search not required] and provably fast global convergence [speed of cubic Newton method].
The implementation of this regularization looks relatively straightforward, so I wonder if it could be incorporated into Optim.jl?
The text was updated successfully, but these errors were encountered:
Here is an interesting variant of Newton's method with regularization: https://www.konstmish.com/publication/21_newton/.
According to the abstract:
The implementation of this regularization looks relatively straightforward, so I wonder if it could be incorporated into Optim.jl?
The text was updated successfully, but these errors were encountered: