Return to search

Iterative Approaches to the Split Feasibility Problem

In this paper we discuss iterative algorithms for solving the split feasibility
problem (SFP). We study the CQ algorithm from two approaches: one
is an optimization approach and the other is a fixed point approach. We
prove its convergence first as the gradient-projection algorithm and secondly
as a fixed point algorithm. We also study a relaxed CQ algorithm in the
case where the sets C and Q are level sets of convex functions. In such case
we present a convergence theorem and provide a different and much simpler
proof compared with that of Yang [7].

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0623109-212714
Date23 June 2009
CreatorsChien, Yin-ting
ContributorsJen-chih Yao, Hong-kun Xu, Lai-jiu Lin, Ngai-ching Wong
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0623109-212714
Rightsunrestricted, Copyright information available at source archive

Page generated in 0.0024 seconds