Iterative Method for Set-Valued Mixed Quasi-variational Inequalities in a Banach Space

This paper introduces an iterative method for finding approximate solutions of a set-valued mixed quasivariational inequality in the setting of a Banach space. Existence of a solution of this rather general problem and the convergence of the proposed iterative method to a solution are established.The first two authors were partially supported by the National Science Council of the Republic of China. The third author was partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and by the Dawn Program Foundation in ShanghaiCommunicated by     

Existence Theorems for Variational Inequalities in Banach Spaces

In this paper, by employing the notion of generalized projection operators and the well-known Fan’s lemma, we establish some existence results for the variational inequality problem and the quasivariational inequality problem in reflexive, strictly convex, and smooth Banach spaces. We propose also an iterative method for approximate solutions of the variational inequality problem and we establish some convergence results for this iterative method. L. C. Zeng, His research was partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and by the Dawn Program Foundation, Shanghai, China. J. C. Yao, His research was partially supported by the National Science Council of the Republic of China     

广义集值强非线性混合似变分不等式的辅助原理和三步迭代算法

使用辅助原理技巧研究了一类广义集值强非线性混合变分不等式．证明了此类集值强非线性混合变分不等式辅助问题解的存在性和唯一性;构建了一个新的三步迭代算法,通过辅助原理技巧,构建并计算此类非线性混合变分不等式的近似解,进一步证明非线性混合变分不等式解的存在性以及由算法产生的三个序列的收敛性．所得结论推广了近年来许多混合变分不等式和准变分不等式以及他们的有关结果．     

Generalized mixed variational-like inequality for random fuzzy mappings

In this paper, we introduce and study a new class of generalized mixed variational-like inequality for random fuzzy mappings(GMVLIP). An existence theorem for auxiliary problem of the GMVLIP is established. Further, by exploiting the theorem, we construct and analyze a new iterative algorithm for finding the solution of the GMVLIP. Furthermore, we prove the existence of a unique solution of the GMVLIP and discuss the convergence analysis of iterative sequence generated by the iterative algorithm.     

Modified Combined Relaxation Method for General Monotone Equilibrium Problems in Hilbert Spaces

In this paper, we study a class of general monotone equilibrium problems in a real Hilbert space which involves a monotone differentiable bifunction. For such a bifunction, a skew-symmetric type property with respect to the partial gradients is established. We suggest to solve this class of equilibrium problems with the modified combined relaxation method involving an auxiliary procedure. We prove the existence and uniqueness of the solution to the auxiliary variational inequality in the auxiliary procedure. Further, we prove also the weak convergence of the modified combined relaxation method by virtue of the monotonicity and the skew-symmetric type property.Communicated by F. GiannessiHis research was partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and by the Dawn Program Foundation in Shanghai.His research was partially supported by a grant from the National Science Council of Taiwan.     

Banach空间中完全广义混合隐似平衡问题的辅助原理和迭代算法

在Banach空间中利用双线性连续泛函F代替内积引进了新的一类完全广义混合隐似平衡问题，引进了F强单调的概念，提出了该平衡问题的广义辅助问题，证明了广义辅助问题的收敛定理，给出了新的算法和由此算法产生的迭代序列的收敛特征．     

On the characterization of strong convergence of an iterative algorithm for a class of multi-valued variational inclusions

This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued variational inclusion problems. Characterization of strong convergence of this iterative method is established. L. C. Ceng’s research partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and the Dawn Program Foundation in Shanghai. S. Schaible’s research partially supported by the National Science Council of Taiwan. This research was partially supported by the grant NSC 96-2628-E-110-014-MY3.     

Existence and iterative approximation of solutions of generalized mixed quasi-variational-like inequality problem in Banach spaces

In this paper, some existence theorems for the mixed quasi-variational-like inequalities problem in a reflexive Banach space are established. The auxiliary principle technique is used to suggest a novel and innovative iterative algorithm for computing the approximate solution for the mixed quasi-variational-like inequalities problem. Consequently, not only the existence of theorems of the mixed quasi-variational-like inequalities is shown, but also the convergence of iterative sequences generated by the algorithm is also proven. The results proved in this paper represent an improvement of previously known results.     

Iterative linear programming solution of convex programs

An iterative linear programming algorithm for the solution of the convex programming problem is proposed. The algorithm partially solves a sequence of linear programming subproblems whose solution is shown to converge quadratically, superlinearly, or linearly to the solution of the convex program, depending on the accuracy to which the subproblems are solved. The given algorithm is related to inexact Newton methods for the nonlinear complementarity problem. Preliminary results for an implementation of the algorithm are given.This material is based on research supported by the National Science Foundation, Grants DCR-8521228 and CCR-8723091, and by the Air Force Office of Scientific Research, Grant AFOSR-86-0172. The author would like to thank Professor O. L. Mangasarian for stimulating discussions during the preparation of this paper.     

Auxiliary Principle and Iterative Algorithms for Lions-Stampacchia Variational Inequalities

In this paper, we extend the auxiliary principle (Cohen in J. Optim. Theory Appl. 49:325–333, 1988) to study a class of Lions-Stampacchia variational inequalities in Hilbert spaces. Our method consists in approximating, in the subproblems, the nonsmooth convex function by a sequence of piecewise linear and convex functions, as in the bundle method for nonsmooth optimization. This makes the subproblems more tractable. We show the existence of a solution for this Lions-Stampacchia variational inequality and explain how to build a new iterative scheme and a new stopping criterion. This iterative scheme and criterion are different from those commonly used in the special case of nonsmooth optimization. We study also the convergence of iterative sequences generated by the algorithm. This work was supported by the National Natural Science Foundation of China (10671135), the Specialized Research Fund for the Doctoral Program of Higher Education (20060610005), the National Natural Science Foundation of Sichuan Education Department of China (07ZB068) and the Open Fund (PLN0703) of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation (Southwest Petroleum University).     

An iterative method for generalized nonlinear complementarity problems

An iterative method for solving generalized nonlinear complementarity problems (Ref. 1) involving stronglyK-copositive operators is introduced. Conditions are presented which guarantee the convergence of the method; in addition, the sequence of iterates is used to prove the existence of a solution to the problem under conditions not included in the previous study. Separate consideration is given to the generalized linear complementarity problem.This research was partially supported by National Science Foundation, Grant No. GP-16293. This paper constitutes part of the junior author's doctoral thesis written at Rensselaer Polytechnic Institute. Research support was provided by an NDEA Fellowship and an RPI Fellowship.     

Finding the largest suborder of fixed width

Finding the largest suborder of fixed width in a partially ordered set is an interesting combinatorial problem with applications in combinatorial optimization and scheduling. We present a polynomial time solution for this problem by transforming it into a minimum cost network flow problem in an appropriate auxiliary network.This research was supported in part by the Natural Sciences and Engineering Research Council of Canada, under Grant No. A1798.     

A hybrid extragradient method for general variational inequalities

In this paper, we introduce and study a hybrid extragradient method for finding solutions of a general variational inequality problem with inverse-strongly monotone mapping in a real Hilbert space. An iterative algorithm is proposed by virtue of the hybrid extragradient method. Under two sets of quite mild conditions, we prove the strong convergence of this iterative algorithm to the unique common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the general variational inequality problem, respectively. L. C. Zeng’s research was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality grant (075105118). J. C. Yao’s research was partially supported by a grant from the National Science Council of Taiwan.     

Existence of Solutions and an Algorithm for Mixed Variational-Like Inequalities in Banach Spaces

In this paper, we study the class of mixed variational-like inequalities in reflexive Banach spaces. By applying a minimax inequality due to the author, some existence and uniqueness theorems for solutions of mixed variational-like inequalities are proved. Next, by applying the auxiliary problem technique, we suggest an innovative iterative algorithm to compute approximate solutions of the mixed variational-like inequality. Finally, convergence criteria are also discussed. This research was supported by NSF, Sichman Education Department of China, Projects 2003A081 and SZD0406. The author expresses his sincere thanks to Professor H.P. Benson and the anonymous referees for careful comments leading to the present version of this paper.     

Generalized Differential Properties of the Auslender Gap Function for Variational Inequalities

In this note, the Auslender gap function, which is used to formulate a variational inequality into an equivalent minimization problem, is shown to be differentiable in the generalized sense and has a lower contingent derivative under suitable conditions. This enables us to establish necessary and sufficient conditions for the existence of a solution to problems of variational inequalities.This research was partially supported by the National Natural Science Foundation of China and the Research Committee of Hong Kong Polytechnic University. Communicated by F. Giannessi     

The Essential Component of the Solution Set for Vector Equilibrium Problems

In the paper, by using Ky Fan’s section theorem, we obtain an existence theorem for vector equilibrium problems. Motivated by the ideas of Kinoshita and McLennan, we introduce the concept of the essential component of the solution set for vector equilibrium problems, and we prove that there exists at least one essential component of the solution set for every vector equilibrium problem satisfying some conditions. Research was partially supported by the Natural Science Foundation of Guangdong Province, P. R. China.     

Local and parallel finite element algorithms for the stokes problem

Based on two-grid discretizations, some local and parallel finite element algorithms for the Stokes problem are proposed and analyzed in this paper. These algorithms are motivated by the observation that for a solution to the Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One technical tool for the analysis is some local a priori estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids. Y. He was partially subsidized by the NSF of China 10671154 and the National Basic Research Program under the grant 2005CB321703; A. Zhou was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic Research Program under the grant 2005CB321704; J. Li was partially supported by the NSF of China under the grant 10701001. J. Xu was partially supported by Alexander von Humboldt Research Award for Senior US Scientists, NSF DMS-0609727 and NSFC-10528102.     

On the convergence of a basic iterative method for the implicit complementarity problem

In Part 1 of this study (Ref. 1), we have defined the implicit complementarity problem and investigated its existence and uniqueness of solution. In the present paper, we establish a convergence theory for a certain iterative algorithm to solve the implicit complementarity problem. We also demonstrate how the algorithm includes as special cases many existing iterative methods for solving a linear complementarity problem.This research was prepared as part of the activities of the Management Sciences Research Group, Carnegie-Mellon University, under Contract No. N00014-75-C-0621-NR-047-048 with the Office of Naval Research.     

Existence of Solutions and Variational Principles for Generalized Vector Systems

By means of generalized KKM theory, we prove a result on the existence of solutions and we establish general variational principles, that is, vector optimization formulations of set-valued maps for vector generalized systems. A perturbation function is involved in general variational principles. We extend the theory of gap functions for vector variational inequalities to vector generalized systems and we prove that the solution sets of the related vector optimization problems of set-valued maps contain the solution sets of vector generalized systems. A further vector optimization problem is defined in such a way that its solution set coincides with the solution set of a weak vector generalized system. Research carried on within the agreement between National Sun Yat-Sen University of Kaohsiung, Taiwan and Pisa University, Pisa, Italy, 2007. L.C. Ceng research was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), and Science and Technology Commission of Shanghai Municipality grant (075105118). J.C. Yao research was partially supported by the National Science Center for Theoretical Sciences at Tainan.     

On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems

By using a smooth entropy function to approximate the non-smooth max-type function, a vertical linear complementarity problem (VLCP) can be treated as a family of parameterized smooth equations. A Newton-type method with a testing procedure is proposed to solve such a system. We show that under some milder than usual assumptions the proposed algorithm finds an exact solution of VLCP in a finite number of iterations. Some computational results are included to illustrate the potential of this approach. This author’s work was partially supported by the National Natural Science Foundation of China (Grant Nos. 10271002 and 10401038). This author’s work was partially supported by the Scientific Research Foundation of Tianjin University for the Returned Overseas Chinese Scholars and the Scientific Research Foundation of Liu Hui Center for Applied Mathematics, Nankai University-Tianjin University.