This article applies splitting techniques developed for set-valued maximal monotone operators to monotone affine variational inequalities, including, as a special case, the classical linear complementarity problem. We give a unified presentation of several splitting algorithms for monotone operators, and then apply these results to obtain two classes of algorithms for affine variational inequalities. The second class resembles classical matrix splitting, but has a novel "under-relaxation" step, and converges under more general conditions. In particular, the convergence proofs do not require the affine operator to be symmetric. We specialize our matrix-splitting-like method to discrete-time optimal control problems formulated as extended linear-quadratic programs In the manner advocated by Rockafellar and Wets. The result Is a highly parallel algorithm, which we Implement and test on the Connection Machine CM-5 computer family.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Management Science and Operations Research
- Parallel computing