← Search

Farshed Abdukhakimov

2 accepted papers

2026

Newton Method Revisited: Global Convergence Rates up to $O(1/k^3)$ for Stepsize Schedules and Linesearch Procedures

ICLR 2026poster

This paper investigates the global convergence of stepsized Newton methods for convex functions with Hölder continuous Hessians or third derivatives. We propose several simple stepsize schedules with fast global convergence guarantees, up to $\mathcal {O}(1/k^3)$ . For cases with multiple plausible…

Cited by 0SourceScholar
2022

The power of first-order smooth optimization for black-box non-smooth problems

ICML 2022spotlight

Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper, besides the oracle complexity, we focus also on iteration complexity, and propose a generic approach that, based on opt…

Cited by 49SourcePDFScholar