Projection-proximal methods for general variational inequalities
نویسنده
چکیده
In this paper, we consider and analyze some new projection-proximal methods for solving general variational inequalities. The modified methods converge for pseudomonotone operators which is a weaker condition than monotonicity. The proposed methods include several new and known methods as special cases. Our results can be considered as a novel and important extension of the previously known results. Since the general variational inequalities include the quasi-variational inequalities and implicit complementarity problems as special cases, results proved in this paper continue to hold for these problems. © 2005 Published by Elsevier Inc.
منابع مشابه
Variational inequalities on Hilbert $C^*$-modules
We introduce variational inequality problems on Hilbert $C^*$-modules and we prove several existence results for variational inequalities defined on closed convex sets. Then relation between variational inequalities, $C^*$-valued metric projection and fixed point theory on Hilbert $C^*$-modules is studied.
متن کاملOn the Convergence and O(1/N) Complexity of a Class of Nonlinear Proximal Point Algorithms for Monotonic Variational Inequalities
This paper presents a class of proximal point algorithms (PPA) with nonlinear proximal terms. Proximal minimization algorithm using Bregman distance for convex minimization is extended for solving monotonic variational inequalities. Under suitable conditions, the convergence and O(1/N) computing complexity/convergence rate of the proposed algorithm is obtained. Further more, connections to some...
متن کاملAn inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملProximal-like contraction methods for monotone variational inequalities in a unified framework1
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. To solve the subproblems of these algorithms, the projection method takes the iteration in form of uk+1 = PΩ[u − αkd]. Interestingly, many of them can be paired such that ũk = PΩ[u − βkF (vk)] = PΩ[ũ − (d2 − Gd1)], where inf{βk} > 0 and G ...
متن کامل