Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
نویسندگان
چکیده
A general approach to analyse convergence and rate of convergence of the proximal-like methods for variational inequalities with set-valued maximal monotone operators is developed. It is oriented to methods coupling successive approximation of the variational inequality with the proximal point algorithm as well as to related methods using regularization on a subspace and weak regularization. This approach seizes also so-called multi-step regularization methods, in which the number of proximal iterations in the approximated problems is controlled by a criterion characterizing these iterations as to be effective.
منابع مشابه
Common Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملHybrid Proximal-Point Methods for Systems of Generalized Equilibrium Problems and Maximal Monotone Operators in Banach Spaces
In this paper, by using Bregman’s technique, we introduce and study the hybrid proximal-point methods for finding a common element of the set of solutions to a system of generalized equilibrium Problems and zeros of a finite family of maximal monotone operators in reflexive Banach spaces. Strong convergence results of the proposed hybrid proximal-point algorithms are also established under some...
متن کاملA Proximal-Projection Method for Finding Zeros of Set-Valued Operators
In this paper we study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximalprojection method is, essentially, a fixed point procedure and our convergence results are based on new generalizations of Lemma Opial. We show how the proximal-projection meth...
متن کاملNote on the Paper: Interior Proximal Method for Variational Inequalities on Non-polyhedral Sets
In this paper we clarify that the interior proximal method developed in [6] (vol. 27 of this journal) for solving variational inequalities with monotone operators converges under essentially weaker conditions concerning the functions describing the ”feasible” set as well as the operator of the variational inequality.
متن کاملRelatively Relaxed Proximal Point Algorithms for Generalized Maximal Monotone Mappings and Douglas-Rachford Splitting Methods
The theory of maximal set-valued monotone mappings provide a powerful framework to the study of convex programming and variational inequalities. Based on the notion of relatively maximal relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing most of investigations on weak convergence using the proximal point algorithm in a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001