Optimal Convex Optimization with Inexact Second-Order Oracles

In this paper, we present a novel second-order method called Accelerated Inexact Newton Extragradient (AINE) for convex optimization using δ-inexact Hessians. We show that AINE can find an ε-solution in the inexact second-order oracle (ISO) complexity of O( (δ/ε)1/2 + (L2/ε)2/7 ) when the Hessian is L2-Lipschitz continuous, and a better complexity of O( (δ/ε)1/2 + (L3/ε)1/5 ) when the third-order derivative is L3-Lipschitz continuous. Notably, each iteration of our method can be conducted in the same running time as matrix multiplication up to logarithmic factors. In addition, we also establish matching oracle complexity lower bounds for both setups, demonstrating the optimality of our methods.