# Riemannian Adaptive Regularized Newton Methods with H"older Continuous Hessians

arXiv: https://arxiv.org/abs/2309.04052 · HTML: https://mlsanity.com/paper/2309.04052/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Sep 2023.

## Built on by (most cited first, 2 of 2)

- [Blockwise Stabilized Adaptive Cubic Regularization with Subsolvers via Recurrence](https://mlsanity.com/paper/2608.22129/) (2026)
- [Newton-CG methods for nonconvex unconstrained optimization with H"older continuous Hessian](https://mlsanity.com/paper/2311.13094/) (2023)

## Abstract (arXiv)

This paper presents strong worst-case iteration and operation complexity guarantees for Riemannian adaptive regularized Newton methods, a unified framework encompassing both Riemannian adaptive regularization (RAR) methods and Riemannian trust region (RTR) methods. We comprehensively characterize the sources of approximation in second-order manifold optimization methods: the objective function's smoothness, retraction's smoothness, and subproblem solver's inexactness. Specifically, for a function with a μ-H"older continuous Hessian, when equipped with a retraction featuring a nu-H"older continuous differential and a θ-inexact subproblem solver, both RTR and RAR with 2+α regularization (where α=minμ,nu,θ) locate an (ε,εα/(1+α))-approximate second-order stationary point within at most O(ε-(2+α)/(1+α)) iterations and at most tildeO(ε-(4+3α)/(2(1+α))) Hessian-vector products. These complexity results are novel and sharp, and reduce to an iteration complexity of O(ε-3/2) and an operation complexity of tildeO(ε-7/4) when α=1.