Projection-type methods are a class of simple methods for solving variational inequalities,
especially for complementarity problems. In this paper we review and summarize recent …

First-order primal-dual methods are appealing for their low memory overhead, fast iterations,
and effective parallelization. However, they are often slow at finding high accuracy solutions …

Until now, no book addressed convexity, monotonicity, and variational inequalities together.
Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization …

Traditionally, most stochastic approximation (SA) schemes for stochastic variational
inequality (SVI) problems have required the underlying mapping to be either strongly …

We consider a class of optimization problems with Cartesian variational inequality (CVI)
constraints, where the objective function is convex and the CVI is associated with a …

We consider stochastic variational inequalities (VIs) with monotone operators where the
feasible set is an intersection of a large number of convex sets. We propose a stochastic …

In this paper, optimality conditions are studied for a class of constrained interval-valued
optimization problems governed by path-independent curvilinear integral (mechanical work) …

This paper deals with the study of weak sharp solutions for nonsmooth variational
inequalities and finite convergence property of the proximal point method. We present …

We solve the stochastic generalized Nash equilibrium (SGNE) problem in merely monotone
games with expected value cost functions. Specifically, we present the first distributed SGNE …

The D-gap function has been useful in developing unconstrained descent methods for
solving strongly monotone variational inequality problems. We show that the D-gap function …