Image de couverture de livre

Strengthening the finite characterizations of smooth min-max games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Krivchenko, Valery, Gasnikov, Alexander, Kovalev, Dmitry
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
par: Vasin, Artem, et autres
Publié: (2025)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
par: Kovalev, Dmitry, et autres
Publié: (2024)

Decentralized Finite-Sum Optimization over Time-Varying Networks
par: Metelev, Dmitry, et autres
Publié: (2024)

Decentralized Optimization with Coupled Constraints
par: Yarmoshik, Demyan, et autres
Publié: (2024)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
par: Kuruzov, Ilya, et autres
Publié: (2022)

A Fisher-Rao gradient flow for entropic mean-field min-max games
par: Lascu, Razvan-Andrei, et autres
Publié: (2024)

Decentralized Distributed Optimization for Saddle Point Problems
par: Rogozin, Alexander, et autres
Publié: (2021)

OPTAMI: Global Superlinear Convergence of High-order Methods
par: Kamzolov, Dmitry, et autres
Publié: (2024)

Optimal Projection-Free Adaptive SGD for Matrix Optimization
par: Kovalev, Dmitry
Publié: (2026)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
par: Kovalev, Dmitry
Publié: (2026)

Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization
par: Kovalev, Dmitry
Publié: (2025)

SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration
par: Kovalev, Dmitry
Publié: (2025)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
par: Liu, Wei, et autres
Publié: (2025)

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
par: Vasin, Artem, et autres
Publié: (2026)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
par: Lobanov, Aleksandr, et autres
Publié: (2025)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
par: Lobanov, Aleksandr, et autres
Publié: (2023)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
par: Divilkovskiy, Maxim, et autres
Publié: (2025)

Bregman Proximal Method for Efficient Communications under Similarity
par: Beznosikov, Aleksandr, et autres
Publié: (2023)

Exploiting higher-order derivatives in convex optimization methods
par: Kamzolov, Dmitry, et autres
Publié: (2022)

Entropic mean-field min-max problems via Best Response flow
par: Lascu, Razvan-Andrei, et autres
Publié: (2023)

Mirror Descent-Ascent for mean-field min-max problems
par: Lascu, Razvan-Andrei, et autres
Publié: (2024)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
par: Borodich, Ekaterina, et autres
Publié: (2025)

Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates
par: Kovalev, Dmitry, et autres
Publié: (2025)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
par: Kovalev, Dmitry, et autres
Publié: (2024)

Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold
par: Zhang, Sixin
Publié: (2024)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
par: Lobanov, Aleksandr, et autres
Publié: (2024)

The Black-Box Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
par: Lobanov, Aleksandr, et autres
Publié: (2023)

Decentralized Inexact Cubic Newton Method with Consensus Procedure
par: Agafonov, Artem, et autres
Publié: (2026)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
par: Pichugin, Alexander, et autres
Publié: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
par: Gasnikov, A. V., et autres
Publié: (2024)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
par: Agafonov, Artem, et autres
Publié: (2023)

Adaptive Regularized Newton Method with Inexact Hessian
par: Shestakov, Aleksandr, et autres
Publié: (2025)

Decentralized Optimization with Mixed Affine Constraints
par: Yarmoshik, Demyan, et autres
Publié: (2026)

Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
par: Savchuk, O. S., et autres
Publié: (2024)

Full characterization of core for nonlinear optimization games
par: Du, Donglei, et autres
Publié: (2026)

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
par: Chen, Xiaokai, et autres
Publié: (2025)

Norm-Constrained Flows and Sign-Based Optimization: Theory and Algorithms
par: Leplat, Valentin, et autres
Publié: (2025)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
par: Lobanov, Aleksandr, et autres
Publié: (2024)

Extragradient Sliding for Composite Non-Monotone Variational Inequalities
par: Emelyanov, Roman, et autres
Publié: (2024)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
par: Chervonenkis, Boris, et autres
Publié: (2024)