Back to search

University of British Columbia

CQ algorithms : theory, computations and nonconvex extensions

Abstract

dc:description

The split feasibility problem (SFP) is important due to its occurrence in signal processing and image reconstruction, with particular progress in intensity-modulated radiation therapy. Mathematically, it can be formulated as finding a point x∗ such that x∗ ∈ C and Ax∗ ∈ Q, where A is a bounded linear operator, C and Q are subsets of two Hilbert spaces H₁ and H₂ respectively. One particular algorithm for solving this problem is the CQ algorithm. In this thesis, previous work on CQ algorithm is presented and a new proof of convergence of the relaxed CQ algorithm is given. The CQ algorithm is shown to be a special case of the subgradient projection algorithm. The SFP is extended into two nonconvex cases. The first one is on S-subdifferentiable functions, and the other one is on prox-regular functions. The subgradient projection algorithm and CQ algorithm are proved to converge to a solution of the first and second case respectively.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Interdisciplinary Studies - Optimization
Grantor dc:publisher
University of British Columbia
Year dc:date
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Guo, Yipin

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivs 2.5 Canada
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/50178

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Guo, Yipin. CQ algorithms : theory, computations and nonconvex extensions. master's thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/50178