Given real matrices
are given nonempty closed convex subsets of
is a given vector in
are given monotone operators. This paper studies the variational inequality problem of determining a vector
An inexact alternating directions method for the above problem is presented that extends the method given in J. Eckstein
, “Some saddle-function splitting methods for convex programming”, Optim. Methods Software 4, 75-83 (1994)].