非扩张映射和广义变分不等式的粘滞逼近法

应用已提出的非扩张映射的粘滞逼近方法,给定初值x_0∈C,考虑一般迭代过程{x_n},g(x_(n+1))=α_nf(x_n)+(1-α_n)SP_C(g(x_n)-λ_nAx_n),n≥0,其中{α_n}■(0,1),S:C→C是非扩张映射,C是实Hilbert空间H的非空闭凸子集.在{α_n}满足合适的条件下可证明,{x_n}强收敛到非扩张映射的不动点集和广义变分不等式解的公共元,且满足某变分不等式.     

A relaxed projection method for variational inequalities

This paper presents a modification of the projection methods for solving variational inequality problems. Each iteration of the proposed algorithm consists of projection onto a halfspace containing the given closed convex set rather than the latter set itself. The algorithm can thus be implemented very easily and its global convergence to the solution can be established under suitable conditions.This work was supported in part by Scientific Research Grant-in-Aid from the Ministry of Education, Science and Culture, Japan.     

A Result on Vector Variational Inequalities with Polyhedral Constraint Sets

In this note, by using some well-known results on properly efficient solutions of vector optimization problems, we show that the Pareto solution set of a vector variational inequality with a polyhedral constraint set can be expressed as the union of the solution sets of a family of (scalar) variational inequalities.     

伪线性映射及其变分不等式解的特征

研究拓扑向量空间到其共轭空间的伪线性映射和其变分不等式问题,给出伪线性映射的几个等价形式,并对伪线性映射的变分不等式解集的特征进行了刻画.     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

Solving variational inequalities by a modified projection method with an effective step-size

In this paper, we propose a new projection method for the solution of variational inequality problems. The method is simple, which uses only function evaluations and projections onto the feasible set. We adopt a new step-size rule and a new search direction in the new method. Under the mild conditions, we prove the proposed method is globally convergent. Preliminary numerical results are reported.     

Local Convergence Behavior of Some Projection-Type Methods for Affine Variational Inequalities

In this paper, we study the local convergence behavior of four projection-type methods for the solution of the affine variational inequality (AVI) problem. It is shown that, if the sequence generated by one of the methods converges to a nondegenerate KKT point of the AVI problem, then after a finite number of iterations, some index sets in the dual variables at each iterative point coincide with the index set of the active constraints in the primal variables at the KKT point. As a consequence, we find that, after finitely many iterations, the four methods need not compute projections and their iterative equations are of reduced dimension.     

关于一类Fuzzy映射的广义变分不等式

本文在拓扩向量空间中研究一类Fuzzy映射的广义变分不等式问题,讨论了这类变分不等式解集的性质及满射性。本文结果改进、推广了作者在[1,2]中的相应结果。     

Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities

In this paper, we introduce and study a relaxed extragradient method for finding solutions of a general system of variational inequalities with inverse-strongly monotone mappings in a real Hilbert space. First, this system of variational inequalities is proven to be equivalent to a fixed point problem of nonexpansive mapping. Second, by using the demi-closedness principle for nonexpansive mappings, we prove that under quite mild conditions the iterative sequence defined by the relaxed extragradient method converges strongly to a solution of this system of variational inequalities. In addition, utilizing this result, we provide some applications of the considered problem not just giving a pure extension of existing mathematical problems. J.-C. Yao’s research was partially supported by a grant from the National Science Council.     

A combined relaxation method for variational inequalities with nonlinear constraints

A simple iterative method for solving variational inequalities with a set-valued, nonmonotone mapping and a convex feasible set is proposed. This set can be defined by nonlinear functions. The method is based on combining and extending ideas contained in various relaxation methods of nonsmooth optimization. Also a modification of the averaging method for the problem under consideration is proposed. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.This research was supported in part by RFFI grant No. 95-01-00061.     

The obstacle problem for beams and plates

The numerical solution of the obstacle problem for beams and plates by means of variational inequalities and finite elements is examined. Algorithms for the solution of the discrete problem are discussed and particular attention is paid to different methods of approximating the constraint. The results of some numerical experiments for beams and plates are included.     

Parallel Algorithms for Solving a Class of Variational Inequalities over the Common Fixed Points Set of a Finite Family of Demicontractive Mappings

Abstract

We propose parallel algorithms for solving a class of variational inequalities over the set of common fixed points for a finite family of demicontractive mappings in real Hilbert spaces. Under some suitable conditions, we prove that the sequence generated by the proposed algorithms converges strongly to a solution of the problem. We apply the proposed algorithms to strongly monotone variational inequality problems with pseudomonotone equilibrium constraints by defining a quasi-nonexpansive and demi-closed mapping whose fixed point set coincides with the solution set of the equilibrium problem.     

Viscosity approximation methods for nonexpansive mappings and monotone mappings

Viscosity approximation methods for nonexpansive mappings are studied. Consider the iteration process {xn}, where x₀∈C is arbitrary and xn+1=αnf(xn)+(1−αn)SPC(xn−λnAxn), f is a contraction on C, S is a nonexpansive self-mapping of a closed convex subset C of a Hilbert space H. It is shown that {xn} converges strongly to a common element of the set of fixed points of nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly-monotone mapping which solves some variational inequality.     

Systems of generalized variational inequalities and their applications ∗

In this paper, we first introduce the system of generalized implicit variational inequalities and prove the existence of its solution. Then we derive existence results for systems of generalized variational and variational like inequalities and system of variational inequalities. As applications, we establish some existence results for a solution to the system of optimization problems which includes the Nash equilibrium problem as a special case     

Two-sided approximations for unilateral variational inequalities by multi-grid methods

For the numerical solution of unilateral variational inequalities two iterative schemes are developed which provide approximations from below resp. from above. Both schemes are based on some kind of active set strategy and require the solution of an algebraic system of equations at each iteration step which is done by means of multigrid techniques. Convergence results are established and illustrated by some numerical results for the elastic-plastic torsion problem     

On the weak convergence of iterative sequences for generalized equilibrium problems and strictly pseudocontractive mappings

In this article we consider the problem of finding a common element in the solution set of generalized equilibrium problems, in the solution set of the classical variational inequality and in the fixed point set of strictly pseudocontractive mappings. Weak convergence theorems of common elements are established in real Hilbert spaces.     

On φ-strongly accretive mappings and some set-valued variational problems

This paper shows that a continuous φ-strongly accretive mapping on a real Banach space is single-valued. And some recent results of set-valued variational inclusions and inequalities are discussed.     

Minimal Coercivity Conditions and Exceptional Families of Elements in Quasimonotone Variational Inequalities

A coercivity condition is usually assumed in variational inequalities over noncompact domains to guarantee the existence of a solution. We derive minimal, i.e., necessary coercivity conditions for pseudomonotone and quasimonotone variational inequalities to have a nonempty, possibly unbounded solution set. Similarly, a minimal coercivity condition is derived for quasimonotone variational inequalities to have a nonempty, bounded solution set, thereby complementing recent studies for the pseudomonotone case. Finally, for quasimonotone complementarity problems, previous existence results involving so-called exceptional families of elements are strengthened by considerably weakening assumptions in the literature.     

Three-step iterations for variational inequalities and nonexpansive mappings

In this paper, we introduce a new three-step iterative scheme for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality using the technique of updating the solution. We show that the sequence converges strongly to a common element of two sets under some control conditions. Results proved in this paper may be viewed as an improvement and refinement of the recent results of Noor and Huang [M. Aslam Noor, Z. Huang, Three-step methods for nonexpansive mappings and variational inequalities, Appl. Math. Comput., in press] and Yao and Yao [Y. Yao, J.C. Yao, On modified iterative method for nonexpansive mappings and monotone mappings, Appl. Math. Comput., in press].     

Projection-Splitting Algorithms for General Monotone Variational Inequalities

We suggest and analyze some new splitting type projection methods for solving general variational inequalities by using the updating technique of the solution. The convergence analysis of these new methods is considered and the proof of convergence is very simple. These new methods are versatile.