General algorithm for variational inequalities

In this paper, we consider a general auxiliary principle technique to suggest and analyze a novel and innovative iterative algorithm for solving variational inequalities and optimization problems. We also discuss the convergence criteria.     

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.     

A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems

In this paper, we introduce and study a new hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of variational inequalities for a ξ-Lipschitz continuous and relaxed (m,v)-cocoercive mappings in Hilbert spaces. Then, we prove a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm which solves some optimization problems under some suitable conditions. Our results extend and improve the recent results of Yao et al. [Y. Yao, M.A. Noor, S. Zainab and Y.C. Liou, Mixed equilibrium problems and optimization problems, J. Math. Anal. Appl (2009). doi:10.1016/j.jmaa.2008.12.005] and Gao and Guo [X. Gao and Y. Guo, Strong convergence theorem of a modified iterative algorithm for Mixed equilibrium problems in Hilbert spaces, J. Inequal. Appl. (2008). doi:10.1155/2008/454181] and many others.     

Convergence of an iterative algorithm for systems of variational inequalities and nonexpansive mappings with applications

In this paper, we consider the problem of convergence of an iterative algorithm for a system of generalized variational inequalities and a nonexpansive mapping. Strong convergence theorems are established in the framework of real Banach spaces.     

A class of new iterative methods for general mixed variational inequalities

In this paper, we use the auxiliary principle technique to suggest a class of predictor-corrector methods for solving general mixed variational inequalities. The convergence of the proposed methods only requires the partially relaxed strongly monotonicity of the operator, which is weaker than co-coercivity. As special cases, we obtain a number of known and new results for solving various classes of variational inequalities and related problems.     

Generalized system for relaxed cocoercive mixed variational inequalities in Hilbert spaces

The approximate solvability of a generalized system for relaxed cocoercive mixed variational inequality is studied by using the resolvent operator technique. The results presented in this paper are more general and include many previously known results as special cases.     

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.     

Convergence analysis of non-quadratic proximal methods for variational inequalities in Hilbert spaces

We consider a general approach for the convergence analysis of proximal-like methods for solving variational inequalities with maximal monotone operators in a Hilbert space. It proves to be that the conditions on the choice of a non-quadratic distance functional depend on the geometrical properties of the operator in the variational inequality, and –- in particular –- a standard assumption on the strict convexity of the kernel of the distance functional can be weakened if this operator possesses a certain `reserve of monotonicity'. A successive approximation of the `feasible set' is performed, and the arising auxiliary problems are solved approximately. Weak convergence of the proximal iterates to a solution of the original problem is proved.     

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].     

New extragradient-type methods for general variational inequalities

In this paper, we consider and analyze a new class of extragradient-type methods for solving general variational inequalities. The modified methods converge for pseudomonotone operators which is weaker condition than monotonicity. Our proof of convergence is very simple as compared with other methods. The proposed methods include several new and known methods as special cases. Our results present a significant improvement of previously known methods for solving variational inequalities and related optimization problems.     

Modified descent-projection method for solving variational inequalities

In this paper, we propose a modified descent-projection method for solving variational inequalities. The method makes use of a descent direction to produce the new iterate and can be viewed as an improvement of the descent-projection method by using a new step size. Under certain conditions, the global convergence of the proposed method is proved. In order to demonstrate the efficiency of the proposed method, we provide numerical results for a traffic equilibrium problems.     

Relaxed extragradient iterative methods for variational inequalities

In this paper, we suggest and analyze some new relaxed extragradient iterative methods for finding a common element of the solution set of a variational inequality, the solution set of a general system of variational inequalities and the set of fixed points of a strictly pseudo-contractive mapping defined on a real Hilbert space. Strong convergence of the proposed methods under some mild conditions is established.     

Approximating solutions of variational inequalities for asymptotically nonexpansive mappings

By using viscosity approximation methods for asymptotically nonexpansive mappings in Banach spaces, some sufficient and necessary conditions for a new type of iterative sequences to converging to a fixed point which is also the unique solution of some variational inequalities are obtained. The results presented in the paper extend and improve some recent results in [C.E. Chidume, Jinlu Li, A. Udomene, Convergence of paths and approximation of fixed points of asymptotically nonexpansive mappings, Proc. Amer. Math. Soc. 138 (2) (2005) 473-480; N. Shahzad, A. Udomene, Fixed point solutions of variational inequalities for asymptotically nonexpansive mappings in Banach spaces, Nonlinear Anal. 64 (2006) 558-567; T.C. Lim, H.K. Xu, Fixed point theories for asymptotically nonexpansive mappings, Nonlinear Anal. TMA, 22 (1994) 1345-1355; H.K. Xu, Viscosity approximation methods for nonexpansive mappings, J. Math. Anal. Appl., 298 (2004) 279-291].     

A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mappings

In this paper, we investigate the problem for finding the set of solutions for equilibrium problems, the set of solutions of the variational inequalities for k-Lipschitz continuous mappings and fixed point problems for nonexpansive mappings in a Hilbert space. We introduce a new viscosity extragradient approximation method which is based on the so-called viscosity approximation method and extragradient method. We show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. Finally, we utilize our results to study some convergence problems for finding the zeros of maximal monotone operators. Our results are generalization and extension of the results of Kumam [P. Kumam, Strong convergence theorems by an extragradient method for solving variational inequalities and equilibrium problems in a Hilbert space, Turk. J. Math. 33 (2009) 85–98], Wangkeeree [R. Wangkeeree, An extragradient approximation method for equilibrium problems and fixed point problems of a countable family of nonexpansive mappings, Fixed Point Theory and Applications, 2008, Article ID 134148, 17 pages, doi:10.1155/2008/134148], Yao et al. [Y. Yao, Y.C. Liou, R. Chen, A general iterative method for an finite family of nonexpansive mappings, Nonlinear Analysis 69 (5–6) (2008) 1644–1654], Qin et al. [X. Qin, M. Shang, Y. Su, A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces, Nonlinear Analysis (69) (2008) 3897–3909], and many others.     

Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities

This paper presents an acceleration step for the linearly convergent diagonalization and projection algorithms for finite-dimensional variational inequalities which is reminiscent of a PARTAN step in nonlinear programming. After establishing the convergence of this technique for both algorithms, several numerical examples are presented to illustrate the sometimes dramatic savings in computation time which this simple acceleration step yields.     

Fixed point theorems and convergence theorems for some generalized nonexpansive mappings

We introduce some condition on mappings. The condition is weaker than nonexpansiveness and stronger than quasinonexpansiveness. We present fixed point theorems and convergence theorems for mappings satisfying the condition.     

Hybrid iterative scheme by a relaxed extragradient method for solutions of equilibrium problems and a general system of variational inequalities with application to optimization

In this paper, we introduce a new iterative process for finding the common element of the set of fixed points of a nonexpansive mapping, the set of solutions of an equilibrium problem and the solutions of the variational inequality problem for two inverse-strongly monotone mappings. We introduce a new viscosity relaxed extragradient approximation method which is based on the so-called relaxed extragradient method and the viscosity approximation method. We show that the sequence converges strongly to a common element of the above three sets under some parametric controlling conditions. Moreover, using the above theorem, we can apply to finding solutions of a general system of variational inequality and a zero of a maximal monotone operator in a real Hilbert space. The results of this paper extended, improved and connected with the results of Ceng et al., [L.-C. Ceng, C.-Y. Wang, J.-C. Yao, Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities, Math. Meth. Oper. Res. 67 (2008), 375–390], Plubtieng and Punpaeng, [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Appl. Math. Comput. 197 (2) (2008) 548–558] Su et al., [Y. Su, et al., An iterative method of solution for equilibrium and optimization problems, Nonlinear Anal. 69 (8) (2008) 2709–2719], Li and Song [Liwei Li, W. Song, A hybrid of the extragradient method and proximal point algorithm for inverse strongly monotone operators and maximal monotone operators in Banach spaces, Nonlinear Anal.: Hybrid Syst. 1 (3) (2007), 398-413] and many others.     

Wiener-hopf equations and variational inequalities

In this paper, we show that the general variational inequality problem is equivalent to solving the Wiener-Hopf equations. We use this equivalence to suggest and analyze a number of iterative algorithms for solving general variational inequalities. We also discuss the convergence criteria for these algorithms.     

Quasimonotone variational inequalities in Banach spaces

Various existence results for variational inequalities in Banach spaces are derived, extending some recent results by Cottle and Yao. Generalized monotonicity as well as continuity assumptions on the operatorf are weakened and, in some results, the regularity assumptions on the domain off are relaxed significantly. The concept of inner point for subsets of Banach spaces proves to be useful.This work was completed while the first author was visiting the Graduate School of Management of the University of California, Riverside. The author wishes to thank the School for its hospitality.