3 papers
math.OC2026
Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and -Smoothness
Alexander Tyurin
We study first-order methods for convex optimization problems with functions satisfying the recently proposed -smoothness condition $||\nabla^{2}f(x)|| \le \ell\left(||\n…
math.OC2026
Optimality in Decentralized Optimization under Bandwidth Constraints
Alexander Tyurin
We consider a realistic decentralized setup with bandwidth-constrained communication and derive optimal time complexities for non-convex stochastic parallel and asynchronous optimi…
math.OC2025
Toward a Unified Theory of Gradient Descent under Generalized Smoothness
Alexander Tyurin
We study the classical optimization problem and analyze the gradient descent (GD) method in both nonconvex and convex settings. It is well-known th…