Variance-reduction for variational inequality problems with Bregman distance function
From MaRDI portal
Cites work
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A Bregman inertial forward-reflected-backward method for nonconvex minimization
- A forward-backward splitting method for monotone inclusions without cocoercivity
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
- A variational inequality framework for network games: existence, uniqueness, convergence and sensitivity analysis
- Bayesian Nash equilibrium and variational inequalities
- Cyclic Coordinate Dual Averaging with Extrapolation
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Extragradient Method with Variance Reduction for Stochastic Variational Inequalities
- Generalized monotone operators and their averaged resolvents
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Minimizing finite sums with the stochastic average gradient
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Revisiting generalized Nash games and variational inequalities
- Robust Stochastic Approximation Approach to Stochastic Programming
- Solving variational inequalities with stochastic mirror-prox algorithm
- Variational inequality formulation for the games with random payoffs
This page was built for publication: Variance-reduction for variational inequality problems with Bregman distance function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847397)
