Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces

In this paper, we introduce a new iterative scheme to investigate the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of solutions of a variational inequality problem for a relaxed cocoercive mapping by viscosity approximate methods. Our results improve and extend the recent ones announced by Chen et al. [J.M. Chen, L.J. Zhang, T.G. Fan, Viscosity approximation methods for nonexpansive mappings and monotone mappings, doi:10.1016/j.jmaa.2006.12.088], Iiduka and Tahakshi [H. Iiduka, W. Takahashi, Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings, Nonlinear Anal. 61 (2005) 341–350], Yao and Yao [Y.H. Yao, J.C. Yao, On modified iterative method for nonexpansive mappings and monotone mappings, Appl. Math. Comput, doi:10.1016/j.amc.2006.08.062] and Many others.     

Generalized System for Relaxed Cocoercive Variational Inequalities and Projection Methods

Let K be a nonempty closed convex subset of a real Hilbert space H. The approximate solvability of a system of nonlinear variational inequality problems, based on the convergence of projection methods, is discussed as follows: find an element (x*, y*)K×K such that

一类变分不等式和非扩张映像不动点问题的一个迭代算法

该文提出了关于含松弛强制映像变分不等式和不动点问题解的一个投影迭代算法,所得结果改进和推广了目前一些作者的研究结果.     

General variational inequalities and nonexpansive mappings

In this paper, we suggest and analyze some three-step iterative schemes for finding the common elements of the set of the solutions of the Noor variational inequalities involving two nonlinear operators and the set of the fixed points of nonexpansive mappings. We also consider the convergence analysis of the suggested iterative schemes under some mild conditions. Since the Noor variational inequalities include variational inequalities and complementarity problems as special cases, results obtained in this paper continue to hold for these problems. Results obtained in this paper may be viewed as an refinement and improvement of the previously known results.     

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.     

Hilbert空间中关于松弛协强制映射的一类新的广义变分不等式组

在本文中,我们首先引入了一类新的关于松弛协强制映射的广义变分不等式组,通过用度量投影的方法,我们证明了这类广义变分不等式组解的存在性和唯一性.我们也建立了一类新的算法来逼近这一不等式组的解,本文的结果使得近期相关结果成为本文的特殊情况.     

The relaxed Newton method derivative: Its dynamics and non-linear properties

The dynamic behaviour of the one-dimensional family of maps f(x)=_c2[(a−1)x+_c1]^{−λ/(α−1)}$f\left(x\right)=c_2{[(a-1)x+c_1]}^{-\lambda /(\alpha -1)}$ is examined, for representative values of the control parameters a,_c1$a,c_1$, _c2$c_2$ and λ$\lambda$. The maps under consideration are of special interest, since they are solutions of the relaxed Newton method derivative being equal to a constant a$a$. The maps f(x)$f\left(x\right)$ are also proved to be solutions of a non-linear differential equation with outstanding applications in the field of power electronics. The recurrent form of these maps, after excessive iterations, shows, in an _xn$x_n$ versus λ$\lambda$ plot, an initial exponential decay followed by a bifurcation. The value of λ$\lambda$ at which this bifurcation takes place depends on the values of the parameters a,_c1$a,c_1$ and _c2$c_2$. This corresponds to a switch to an oscillatory behaviour with amplitudes of f(x)$f\left(x\right)$ undergoing a period doubling. For values of a$a$ higher than 1 and at higher values of λ$\lambda$ a reverse bifurcation occurs. The corresponding branches converge and a bleb is formed for values of the parameter _c1$c_1$ between 1 and 1.20. This behaviour is confirmed by calculating the corresponding Lyapunov exponents.     

Generalized system for relaxed cocoercive variational inequalities in Hilbert spaces

In this article, we introduce and consider a general system of variational inequalities. Using the projection technique, we suggest and analyse new iterative methods for this system of variational inequalities. We also study the convergence analysis of the new iterative method under certain mild conditions. Since this new system includes the system of variational inequalities involving the single operator, variational inequalities and related optimization problems as special cases, results obtained in this article continue to hold for these problems. Our results improve and extend the recent ones announced by many others.     

Penalty technique for a min-max control problem

Using relaxed controls, optimality conditions are derived for a control problem where the cost ess supG(x,u,t) is minimized. In reformulating the problem, we impose a unilateral constraint, which we deal with by a penalty method. Associated with the unilateral constraint, we obtain a multiplier which is related to a measuredp. This measure is a positive Radon measure ifG is continuous in all its arguments and is a finitely additive positive Radon measure ifG is only measurable in thet-variable. We have indicated how the results of Girsanov follow from our results and how our results are related to Holmaker's.     

Calculus of variations inL ∞

Given an arbitrary function we determine the greatest quasiconvex minorant of the function in a way analogous to the classical Legendre-Fenchel transform. The greatest quasiconvex minorant is shown to be the same as the lower semicontinuous regularization of the functional. This fact is used to produce the relaxation of functionals onL ^∞ of the formF (ξ, ξ′)=ess sup_0≤s≤T h(s, ξ(s), ξ′(s)). The relaxed functional will be lower semicontinuous in the appropriate topology and yields the existence of a minimizer. Then the relaxation theorem is established, proving that the original problem and the relaxed problem have the same values under broad assumptions onh. The research of E. N. Barron was supported in part by Grants DMS-9102967 and DMS-9300805, and that of W. Liu by DMS-9300805 from the National Science Foundation.     

PARALLEL CHAOTIC MULTISPLITTING ITERATIVE METHODS FOR THE LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEM

1. IntroductionWe consider the linear complementarity problem LCP(M,q): Find a z E m such thatwhere M = (mij) E boxs and q ~ (qi) 6 m are given real matriX and vector, respectively.This problem axises in various scientific computing areas such as the Nash equilibritun poillt ofa bimatrir game (e.g., Cottle and Dantzig[4] and Lelnke[12j) and the free boundary problems offluid mechedcs (e.g., Cryer[8]). There have been a lot of researches on the approximate solutionof the linear complemeat…     

The 6-relaxed game chromatic number of outerplanar graphs

Suppose G is a graph and k,d are integers. The (k,d)-relaxed colouring game on G is a game played by two players, Alice and Bob, who take turns colouring the vertices of G with legal colours from a set X of k colours. Here a colour i is legal for an uncoloured vertex x if after colouring x with colour i, the subgraph induced by vertices of colour i has maximum degree at most d. Alice’s goal is to have all the vertices coloured, and Bob’s goal is the opposite: to have an uncoloured vertex without a legal colour. The d-relaxed game chromatic number of G, denoted by , is the least number k so that when playing the (k,d)-relaxed colouring game on G, Alice has a winning strategy. This paper proves that if G is an outerplanar graph, then for d≥6.     

广义混合似变分不等式组的两步迭代算法

对H ilbert空间中一类广义混合似变分不等式组进行了研究;利用次微分算子的预解式技术,建立了广义混合似变分不等式组与不动点问题之间的等价关系;给出了一个求解这种广义混合似变分不等式组的显式两步迭代算法;并证明了该算法在适当的条件下收敛.     

A NEW GENERALIZED ASYNCHRONOUS PARALLEL MULTISPLITTING ITERATION METHOD

1.IntroductionTosolvelargesparsesystemsoflinearandnonlinearequationsonthemultiprocessorsystems,manyauthorspresentedandstudiedvariousparalleliterativemethodsinthesenseofmultisplittinginrecentyears.FOrdetailsonecanreferto[1]-[9]andreferencestherein.Amo...     

About the relaxed cocoercivity and the convergence of the proximal point algorithm

The aim of this paper is to study the convergence of two proximal algorithms via the notion of (α, r)-relaxed cocoercivity without Lipschitzian continuity. We will show that this notion is enough to obtain some interesting convergence theorems without any Lipschitz-continuity assumption. The relaxed cocoercivity case is also investigated.     

An extragradient method for relaxed cocoercive variational inequality and equilibrium problems

The purpose of this paper is to investigate the problem of finding the common element of the set of common fixed points of a countable family of nonexpansivemappings, the set of an equilibrium problem and the set of solutions of the variational inequality problem for a relaxed cocoercive and Lipschitz continuous mapping in Hilbert spaces. Then, we show that the sequence converges strongly to a common element of the above three sets under some parameter controlling conditions, which are connected with Yao, Liou, Yao, Takahashi and many others.     

广义异步矩阵多分裂向前向后松弛算法

本文建立了一类广义异步矩阵多分裂向前向后松弛算法，并在系数矩阵是Ｈ－矩阵的条件下，证明了这类算法的收敛性．     

Attracting cycles for the relaxed Newton’s method

We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n≥2, we may construct a polynomial so that when the method is applied to a polynomial, the resulting rational function has an attracting cycle of period n. We show that when we use the method to extract radicals, the set consisting of the points at which the method fails to converge to the roots of the polynomial p(z)=z^m−c (this set includes the Julia set) has zero Lebesgue measure. Consequently, iterate sequences under the relaxed Newton’s method converge to the roots of the preceding polynomial with probability one.     

On random variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings

In this paper, we introduce and study the random variational inclusions with random fuzzy and random relaxed cocoercive mappings. We define an iterative algorithm for finding the approximate solutions of this class of variational inclusions and establish the convergence of iterative sequences generated by proposed algorithm. Our results improve and generalize many known corresponding results.     

Relaxed very asymmetric coloring games

This paper investigates a competitive version of the coloring game on a finite graph G. An asymmetric variant of the (r,d)-relaxed coloring game is called the (r,d)-relaxed (a,b)-coloring game. In this game, two players, Alice and Bob, take turns coloring the vertices of a graph G, using colors from a set X, with |X|=r. On each turn Alice colors a vertices and Bob colors b vertices. A color α∈X is legal for an uncolored vertex u if by coloring u with color α, the subgraph induced by all the vertices colored with α has maximum degree at most d. Each player is required to color an uncolored vertex legally on each move. The game ends when there are no remaining uncolored vertices. Alice wins the game if all vertices of the graph are legally colored, Bob wins if at a certain stage there exists an uncolored vertex without a legal color. The d-relaxed (a,b)-game chromatic number, denoted by , of G is the least r for which Alice has a winning strategy in the (r,d)-relaxed (a,b)-coloring game.The (r,d)-relaxed (1,1)-coloring game has been well studied and there are many interesting results. For the (r,d)-relaxed (a,1)-coloring game, this paper proves that if a graph G has an orientation with maximum outdegree k and a≥k, then for all d≥k²+2k; If a≥k³, then (a,1)- for all d≥2k+1.