Solving Convex Split Feasibility Problems and Applications

Host Institution:

University of South Australia

Title of Seminar:

Solving Convex Split Feasibility Problems and Applications

Speaker's Name:

Dr Victoria Martín-Márquez

Speaker's Institution:

Department of Mathematical Analysis, Universidad de Sevilla

Time and Date:

Tuesday 12 November 2013, 3.00pm (AEDT)

Seminar Abstract:

The split feasibility problem (SFP) consists in finding a point in a closed convex subset of a Hilbert space such that its image under a bounded linear operator belongs to a closed convex subset of another Hilbert space. Since its inception in 1994 by Censor and Elfving, it has received much attention thanks mainly to its applications to signal processing and image reconstruction. Iterative methods can be employed to solve the SFP. One of the most popular iterative method is Byrne's CQ algorithm. However, this algorithm requires prior knowledge (or at least an estimate) of the norm of the bounded linear operator. We introduce a stepsize selection method so that the implementation of the CQ algorithm does not need any prior information regarding the operator norm. Furthermore, a relaxed CQ algorithm, where the two closed convex sets are both level sets of convex functions, and a Halpern-type algorithm are studied under the same stepsize rule, yielding both weak and strong convergence. A more general problem, the Multiple-sets split feasibility problem, will be also presented. Numerical experiments are included to illustrate the applications to signal processing and, in particular, to compressed sensing and wavelet-based signal restoration.
Based on joint works with G. López and H-K Xu..

Seminar Contact:

This email address is being protected from spambots. You need JavaScript enabled to view it.

AGR Support:

This email address is being protected from spambots. You need JavaScript enabled to view it.