Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness
DOI10.1007/978-3-031-22543-7_10zbMath1529.90057arXiv2207.09544OpenAlexW4313407156MaRDI QIDQ6169117
A. V. Gasnikov, Alexander A. Titov, Fedor S. Stonyakin, Seydamet S. Ablaev, Mohammad S. Alkousa
Publication date: 10 August 2023
Published in: Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.09544
variational inequalityHölder continuitysaddle point problemrestart techniquestrongly convex programming problem
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Gradient methods for minimizing composite functions
- First-order methods of smooth convex optimization with inexact oracle
- Universal gradient methods for convex optimization problems
- Modified projection method for strongly pseudomonotone variational inequalities
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
- Accelerated methods for saddle-point problem
- An adaptive proximal method for variational inequalities
- Numerical methods for some classes of variational inequalities with relatively strongly monotone operators
- Lectures on Modern Convex Optimization
- Saddle-Point Dynamics: Conditions for Asymptotic Stability of Saddle Points
- Saddlepoint Problems in Continuous Time Rational Expectations Models: A General Method and Some Macroeconomic Examples
- Temporary General Equilibrium Theory
- An Introduction to Variational Inequalities and Their Applications
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems
- On Nonconvex Optimization for Machine Learning
- A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Inexact model: a framework for optimization and variational inequalities
- Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness
This page was built for publication: Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness
