Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming

Abstract

A classical method for solving the variational inequality problem is the projection algorithm. We show that existing convergence results for this algorithm follow from one given by Gabay for a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Moreover, we extend the projection algorithm to solve any monotone affine variational inequality problem. When applied to linear complementarity problems, we obtain a matrix splitting algorithm that is simple and, for linear/quadratic programs, massively parallelizable. Unlike existing matrix splitting algorithms, this algorithm converges under no additional assumption on the problem. When applied to generalized linear/quadratic programs, we obtain a decomposition method that, unlike existing decomposition methods, can simultaneously dualize the linear constraints and diagonalize the cost function. This method gives rise to highly parallelizable algorithms for solving a problem of deterministic control in discrete time and for computing the orthogonal projection onto the intersection of convex sets.

Splitting Methods for Pseudomonotone Mixed Variational Inequalities

“…This can lead to very efficient meth-ods, since one can treat each part of the original operator independently. The operator splitting methods and related techniques have been analyzed w x and studied by many researchers, including Peaceman and Rachford 24 , w x w x w x Lions and Mercier 12 , Glowinski and Le Tallec 8 , and Tseng 30,31 .…”

A proximal alternating linearization method for nonconvex optimization problems

“…Among them the well known are operator splitting methods [9,23,28,40,41] and alternating direction methods [5,11,12,16,45] and so on. These NSO methods are explicitly or implicitly derived from proximal point algorithms.…”

Some Goldstein's type methods for co-coercive variant variational inequalities

“…[11,24,27,28,30,[35][36][37]. Recall that F is called co-coercive if there exists a positive constant τ (co-coercive modulus) such that…”