A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent
From MaRDI portal
Publication:6039155
DOI10.1134/s0965542523020045arXiv2201.12206OpenAlexW4363603927MaRDI QIDQ6039155
A. Yu. Maslovskii, D. A. Pasechnyuk, K. E. Zainullina, A. V. Gasnikov, A. N. Beznosikov
Publication date: 3 May 2023
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.12206
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- Dual extrapolation and its applications to solving variational inequalities and related problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Coordinate descent algorithms
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Solving variational inequalities with Stochastic Mirror-Prox algorithm
- A Stochastic Approximation Method
This page was built for publication: A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent