NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.112 seconds)
1

Iterative Approaches to the Split Feasibility Problem

Chien, Yin-ting 23 June 2009 (has links)
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].
firmly nonexpansive mapping
relaxed CQ algorithm.
CQ algorithm
gradient projectionalgorithm
projection
averaged mapping
Split feasibility problem
inverse strongly monotone operator

Page generated in 0.1154 seconds