On finite convergence of proximal point algorithms for variational inequalities
نویسندگان
چکیده
منابع مشابه
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...
متن کاملOn New Proximal Point Methods for Solving the Variational Inequalities
It is well known that the variational inequalities are equivalent to the fixed point problem. We use this alternative equivalent formulation to suggest and analyze some new proximal point methods for solving the variational inequalities. These new methods include the explicit, the implicit, and the extragradient methods as special cases. The convergence analysis of the new methods is considered...
متن کاملStrong convergence for variational inequalities and equilibrium problems and representations
We introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition for ...
متن کاملSuper-Relaxed (η)-Proximal Point Algorithms, Relaxed (η)-Proximal Point Algorithms, Linear Convergence Analysis, and Nonlinear Variational Inclusions
We glance at recent advances to the general theory of maximal set-valued monotone mappings and their role demonstrated to examine the convex programming and closely related field of nonlinear variational inequalities. We focus mostly on applications of the super-relaxed η proximal point algorithm to the context of solving a class of nonlinear variational inclusion problems, based on the notion ...
متن کاملInexact proximal point method for general variational inequalities
In this paper, we suggest and analyze a new inexact proximal point method for solving general variational inequalities, which can be considered as an implicit predictor–corrector method. An easily measurable error term is proposed with further relaxed error bound and an optimal step length is obtained by maximizing the profit-function and is dependent on the previous points. Our results include...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2005
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2005.03.026