| Article ID: | iaor20003635 |
| Country: | Netherlands |
| Volume: | 12 |
| Issue: | 1/2/3 |
| Start Page Number: | 31 |
| End Page Number: | 40 |
| Publication Date: | Jan 1999 |
| Journal: | Computational Optimization and Applications |
| Authors: | Teboulle Marc, Auslender Alfred, Ben-Tiba Sami |
| Keywords: | Proximal-like method |
We present a new method for solving variational inequalities on polyhedra. The method is proximal based, but uses a very special logarithmic-quadratic proximal term which replaces the usual quadratic, and leads to an interior proximal type algorithm. We allow for computing the iterates approximately and prove that the resulting method is globally convergent under the sole assumption that the optimal set of the variational inequality is nonempty.