3.9 Article

Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems

Journal

FIXED POINT THEORY AND APPLICATIONS
Volume -, Issue -, Pages 1-10

Publisher

SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1186/1687-1812-2011-101

Keywords

fixed point; variational inequality; double-net algorithm; hierarchical convergence; Hilbert space

Categories

-

Funding

  1. Colleges and Universities Science and Technology Development Foundation of Tianjin [20091003]
  2. NSFC [11071279]
  3. Korea Research Foundation
  4. Korean Government [KRF-2008-313-C00050]
  5. [NSC 99-2221-E-230-006]

Ask authors/readers for more resources

In this paper, we show the hierarchical convergence of the following implicit double-net algorithm: x(s,t) = s[tf(x(s,t))+(1-t)(x(s,t)-mu Ax(s,t))]+(1-s)1/lambda(s) integral(lambda s)(0) T(nu)x(s,t)d nu, for all s,t epsilon (0,1), where f is a rho-contraction on a real Hilbert space H, A : H -> H is an alpha-inverse strongly monotone mapping and S = {T(s)}(s >= 0): H -> H is a nonexpansive semi-group with the common fixed points set Fix(S) not equal a..., where Fix(S) denotes the set of fixed points of the mapping S, and, for each fixed t epsilon (0, 1), the net {x(s,t)} converges in norm as s -> 0 to a common fixed point x(t) epsilon Fix(S) of {T(s)}(s >= 0)and, as t -> 0, the net {x(t)} converges in norm to the solution x* of the following variational inequality: {x* epsilon Fix(S); (Ax*, x-x*)>= 0,for all x epsilon Fix(S).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.9
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available