Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Frank-Wolfe Algorithms for Saddle Point Problems (2016, background): “Moreover, it provides a partial answer to the conjecture from Hammond [9].”
Subspace Robust Wasserstein distances (2019, background): “Smoothing It is well known that saddle points are hard to compute for a bilinear objective (Hammond, 1984).”
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (1990, methodology): “We refer to the dissertation by Hammond [86] and the papers by Hammond and Magnanti [87, 88] for further discussion on the convergence of the symmetrized methods.”