HYBRID EXTRAGRADIENT METHODS FOR FINDING MINIMUM-NORM SOLUTIONS OF SPLIT FEASIBILITY PROBLEMS

被引：0

作者：

Ceng, Lu-Chuan ^{[2
,3
]}

Wong, Ngai-Ching ^{[1
,4
]}

Yao, Jen-Chih ^{[5
]}

机构：

[1] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 804, Taiwan

[2] Shanghai Normal Univ, Dept Math, Shanghai 200234, Peoples R China

[3] Sci Comp Key Lab Shanghai Univ, Shanghai 200234, Peoples R China

[4] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 804, Taiwan

[5] China Med Univ, Ctr Gen Educ, Taichung 40402, Taiwan

来源：

JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2015年 / 16卷 / 10期

基金：

美国国家科学基金会;

关键词：

Split feasibility problems; fixed point problems; hybrid extragradient methods; strictly pseudocontractive mappings; nonexpansive mappings; minimum-norm solutions; demiclosedness principle; algorithms; FIXED-POINT PROBLEMS; VARIATIONAL-INEQUALITIES; NONEXPANSIVE-MAPPINGS; STRONG-CONVERGENCE; MONOTONE MAPPINGS; WEAK-CONVERGENCE; PROJECTION METHODS; HILBERT-SPACES; CQ ALGORITHM; SETS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we consider the split feasibility problem (SFP) on a nonempty closed convex subset C of a Hilbert space of arbitrary dimension. When C is given as the common fixed point set of nonexpansive mappings, combining Mann's iterative method, Korpelevich's extragradient method and the hybrid steepest-descent method, we develop an iterative algorithm. This algorithm provides the strong convergence to the minimum-norm solution of the SFP. On the other hand, we study the hybrid extragradient methods for finding a common element of the solution set Gamma of the SFP and the set Fix(S) of fixed points of a strictly pseudocontractive mapping S. We propose an iterative algorithm which generates sequences converging weakly to an element of Fix(S) boolean AND Gamma.

引用

页码：1965 / 1983

页数：19

共 48 条

[1]

[Anonymous], 1990, CAMBRIDGE STUDIES AD

[2]

[Anonymous], 1994, Numer. Algor., DOI [DOI 10.1007/BF02142692, 10.1007/BF02142692]

[3]

[Anonymous], 1987, Image Recovery

[4]

BERTSEKAS DP, 1982, MATH PROGRAM STUD, V17, P139

[5] Iterative oblique projection onto convex sets and the split feasibility problem [J].

Byrne, C .

INVERSE PROBLEMS, 2002, 18 (02) :441-453

[6] A unified treatment of some iterative algorithms in signal processing and image reconstruction [J].

Byrne, C .

INVERSE PROBLEMS, 2004, 20 (01) :103-120

[7] Relaxed Extragradient Methods with Regularization for General System of Variational Inequalities with Constraints of Split Feasibility and Fixed Point Problems [J].

Ceng, L. C. ;

Petrusel, A. ;

Yao, J. C. .

ABSTRACT AND APPLIED ANALYSIS, 2013,

[8]

Ceng LC, 2013, J NONLINEAR CONVEX A, V14, P163

[9] Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem [J].

Ceng, L. -C. ;

Ansari, Q. H. ;

Yao, J. -C. .

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2012, 75 (04) :2116-2125

[10] An extragradient method for solving split feasibility and fixed point problems [J].

Ceng, L-C ;

Ansari, Q. H. ;

Yao, J-C .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 64 (04) :633-642

← 1 2 3 4 5 →