Title page for etd-0623109-212714


[Back to Results | New Search]

URN etd-0623109-212714
Author Yin-ting Chien
Author's Email Address piif3538@yahoo.com.tw
Statistics This thesis had been viewed 5064 times. Download 1147 times.
Department Applied Mathematics
Year 2008
Semester 2
Degree Master
Type of Document
Language English
Title Iterative Approaches to the Split
Feasibility Problem
Date of Defense 2009-06-16
Page Count 28
Keyword
  • firmly nonexpansive mapping
  • relaxed CQ algorithm.
  • CQ algorithm
  • gradient projectionalgorithm
  • projection
  • averaged mapping
  • Split feasibility problem
  • inverse strongly monotone operator
  • Abstract 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].
    Advisory Committee
  • Lai-jiu Lin - chair
  • Jen-chih Yao - co-chair
  • Ngai-ching Wong - co-chair
  • Hong-kun Xu - advisor
  • Files
  • etd-0623109-212714.pdf
  • indicate access worldwide
    Date of Submission 2009-06-23

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys