Siêu thị PDFTải ngay đi em, trời tối mất

Thư viện tri thức trực tuyến

Kho tài liệu với 50,000+ tài liệu học thuật

© 2023 Siêu thị PDF - Kho tài liệu học thuật hàng đầu Việt Nam

Phương pháp lặp Mann-Halpern cải biên trong không gian Hilbert
MIỄN PHÍ
Số trang
6
Kích thước
147.1 KB
Định dạng
PDF
Lượt xem
1717

Phương pháp lặp Mann-Halpern cải biên trong không gian Hilbert

Nội dung xem thử

Mô tả chi tiết

Nguyin Diic Lang Tap chf KHOA HQC & CONG NGHE 173(13): 213 - 218

MANN-HALPERN ITERATION METHODS IMPROVE

HILBERT SPACES

Nguyen Due Lang

University of Sciences, Thainguyen University

E-mail: [email protected]

Abstract. In this paper, we introduce some new iteration methods based on the hybrid

method in mathematical programming, the Mann's iterative method and the Halpern's

method for finding a fixed point of a nonexpansive mapping and a common fixed point

of a nonexpansive Hilbert spaces.

2000 Mathematic s Subject Classification: 47H17, 47H06.

Keywords; Nonexpansive mapping , fixed points, variationed inequalities.

1. Introduction

Let if be a real Hilbert space with the scalar product and the norm denoted by the

symbols {.,.) and ||. ||, respectively, and let C be a nonempty closed and convex subset of

H. Denote by Pc{x) the metric projection from x Q H onto C. Let T be a nonexpansive

mapping on C, i.e., T ; C -)• C and \\Tx - Ty\\ < \\x - y\\ for aW x,y e C. We use

F{T) to denote the set of fixed points of T, i.e., F{T) = {x € C : x = Tx}. We know

that F{T) is nonempty, if C is bounded, for more details see [1].

tOT finding a fixed point of a nonexpansive mapping T on C, in 1953, Mann [3]

proposed the following method:

XQ & C any element,

•Xn+l = anXn + (1 - an)TXn, '

that converges only weakly, in general (see [4] for an example). In 1967, Halpern [5]

firstly proposed the following iteration process;

Xn+l = 0nU + {^ - ^n)TXn, U > 0, , (1.2)

where u,Xo are two fixed elements in C and {0n} C (0,1). He pointed out that the

conditions limn_>.oo ^„ = 0 and ^^ g /^n = oo are necessary in the sense that, if the

iteration (1.2) converges to a fixed point of T, then these conditions must be satisfied.

Further, the iteration method was investigated by Lions [6], Reich [7], Wittmann [8]

and Song [9]. Recently, Alber [10] proposed the following descent-like method

Xn+l = Pc{Xn ~ lln[Xn - Tx^]),n> 0, (1.3)

and proved that if {^n} : jUn > 0,/i„ -)• 0, as n ^^ oo and {x„} is bounded, then:

(i) there exists a weak accumulation point x € C of {x„};

(ii) all weak accumulation points of {xn} belong to F{T); and

(iii) ' X^) is ^ singleton, i.e., F{T) = {x}, then {x„} converges weakly to x.

Tải ngay đi em, còn do dự, trời tối mất!