Cover Image

OPTAMI: Global Superlinear Convergence of High-order Methods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kamzolov, Dmitry, Pasechnyuk, Dmitry, Agafonov, Artem, Gasnikov, Alexander, Takáč, Martin
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

Cubic Regularized Newton Method with Variance Reduction for Finite-sum Non-convex Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
by: Agafonov, Artem, et al.
Published: (2023)

Decentralized Inexact Cubic Newton Method with Consensus Procedure
by: Agafonov, Artem, et al.
Published: (2026)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

Adaptive Regularized Newton Method with Inexact Hessian
by: Shestakov, Aleksandr, et al.
Published: (2025)

Heterogeneous-Horizon Exact-Weight Local SGD
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2026)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
by: Ostroukhov, Petr, et al.
Published: (2024)

Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
by: Lobanov, Aleksandr, et al.
Published: (2024)

Ethic Duality: A Homological Framework for Primal-Dual Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms
by: Abdukhakimov, Farshed, et al.
Published: (2023)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

Moduli space of optimization algorithms
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

$ψ$DAG: Projected Stochastic Approximation Iteration for DAG Structure Learning
by: Ziu, Klea, et al.
Published: (2024)

Strengthening the finite characterizations of smooth min-max games
by: Krivchenko, Valery, et al.
Published: (2026)

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
by: Vasin, Artem, et al.
Published: (2026)

Bregman Proximal Method for Efficient Communications under Similarity
by: Beznosikov, Aleksandr, et al.
Published: (2023)

Newton Method Revisited: Global Convergence Rates up to $\mathcal {O}\left(k^{-3} \right)$ for Stepsize Schedules and Linesearch Procedures
by: Hanzely, Slavomír, et al.
Published: (2024)

Decentralized Finite-Sum Optimization over Time-Varying Networks
by: Metelev, Dmitry, et al.
Published: (2024)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

Revisiting Superlinear Convergence of Proximal Newton-Like Methods to Degenerate Solutions
by: Lee, Ching-pei, et al.
Published: (2026)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
by: Zhou, Zhiling, et al.
Published: (2024)

Distributed Optimization Algorithm with Superlinear Convergence Rate
by: Xu, Yeming, et al.
Published: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
by: Liu, Zhuanghua, et al.
Published: (2024)

Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities
by: Beznosikov, Aleksandr, et al.
Published: (2023)

Decentralized Optimization with Coupled Constraints
by: Yarmoshik, Demyan, et al.
Published: (2024)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
by: Lobanov, Aleksandr, et al.
Published: (2023)

A Superlinearly Convergent Evolution Strategy
by: Glasmachers, Tobias
Published: (2025)

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions
by: Sadchikov, Andrey, et al.
Published: (2024)

The Black-Box Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
by: Lobanov, Aleksandr, et al.
Published: (2023)

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
by: Savchuk, O. S., et al.
Published: (2024)

Loss-Transformation Invariance in the Damped Newton Method
by: Shestakov, Alexander, et al.
Published: (2025)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
by: Pichugin, Alexander, et al.
Published: (2024)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
by: Kuruzov, Ilya, et al.
Published: (2022)

Superlinear Optimization Algorithms
by: Wang, Hongxia, et al.
Published: (2024)

Accelerated Methods with Compression for Horizontal and Vertical Federated Learning
by: Stanko, Sergey, et al.
Published: (2024)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
by: Lobanov, Aleksandr, et al.
Published: (2025)