Cover Image

Universal methods for variational inequalities: deterministic and stochastic cases

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Klimza, Anton, Gasnikov, Alexander, Stonyakin, Fedor, Alkousa, Mohammad
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

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
by: Kuruzov, Ilya, et al.
Published: (2022)

Lipschitz-Free Mirror Descent Methods for Relatively Strongly Convex Functions with/without Absolute and Relative Inexactness
by: Alkousa, Mohammad S., et al.
Published: (2026)

Higher Degree Inexact Model for Optimization problems
by: Alkousa, Mohammad, et al.
Published: (2024)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
by: Stonyakin, Fedor, et al.
Published: (2021)

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
by: Alkousa, Mohammad, et al.
Published: (2024)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
by: Alkousa, Mohammad S., et al.
Published: (2026)

Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
by: Alkousa, Mohammad S., et al.
Published: (2025)

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
by: Vyguzov, Alexander, et al.
Published: (2024)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, 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)

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

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
by: Kuruzov, Ilya, et al.
Published: (2024)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

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

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

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

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

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, et al.
Published: (2025)

A Fully Adaptive Frank-Wolfe Algorithm for Relatively Smooth Problems and Its Application to Centralized Distributed Optimization
by: Vyguzov, A. A., et al.
Published: (2025)

Frank-Wolfe Algorithms for (L0, L1)-smooth functions
by: Vyguzov, A. A., et al.
Published: (2025)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
by: Chervonenkis, Boris, et al.
Published: (2024)

Stability for a stochastic fractional differential variational inequality with Lévy jump
by: Zeng, Yue, et al.
Published: (2024)

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

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
by: Salloum, Hadi, et al.
Published: (2025)

Randomized gradient-free methods in convex optimization
by: Gasnikov, Alexander, et al.
Published: (2022)

Tikhonov regularized exterior penalty methods for hierarchical variational inequalities
by: Marschner, Meggie, et al.
Published: (2025)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
by: Lobanov, Aleksandr, et al.
Published: (2024)

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

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

Average-case optimization analysis for distributed consensus algorithms on regular graphs
by: Nguyen, Nhat Trung, et al.
Published: (2024)

Well-posedness and propagation of chaos for McKean-Vlasov stochastic variational inequalities
by: Ning, Ning, et al.
Published: (2024)

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)

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

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

Decentralized Optimization with Mixed Affine Constraints
by: Yarmoshik, Demyan, et al.
Published: (2026)

Towards stochastic realization theory for Generalized Linear Switched Systems with inputs: decomposition into stochastic and deterministic components and existence and uniqueness of innovation form
by: Rouphael, Elie, et al.
Published: (2024)

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)

Extragradient Sliding for Composite Non-Monotone Variational Inequalities
by: Emelyanov, Roman, et al.
Published: (2024)