| dc.description.abstracteng | In this thesis, we give an analysis of fixed point algorithms involving projections onto closed, not necessarily convex, subsets of finite dimensional vector
spaces.
These methods are used in applications such as imaging science, signal processing, and inverse problems. The tools used in the analysis
place this work at the intersection of optimization and variational analysis. Based on the underlying optimization problems, this work is devided into two main parts. The first one is the compressed sensing problem. Because the problem
is NP-hard, we relax it to a feasibility problem with two sets, namely,
the set of vectors with at most s nonzero entries and, for a linear mapping M
the affine subspace B of vectors satisfying Mx=p for p given.
This problem will be referred to as the sparse-affine-feasibility problem. For the Douglas-Rachford algorithm, we give the proof of linear convergence to a fixed point in the case of a feasibility problem of two affine subspaces.
It allows us to conclude a result of local linear convergence of the Douglas-Rachford algorithm in the sparse affine feasibility problem.
Proceeding, we name sufficient conditions for the alternating projections algorithm to converge to the intersection of an affine subspace with lower level sets
of point symmetric, lower semicontinuous, subadditive functions.
This implies convergence of alternating projections to a solution of the sparse affine feasibility problem.
Together with a result of local linear convergence of the alternating projections algorithm, this allows us to deduce linear convergence after finitely many steps
for any initial point of a sequence of points generated by the alternating projections algorithm. The second part of this dissertation deals with the minimization of the rank of matrices satisfying a set of linear equations.
This problem will be called rank-constrained-affine-feasibility problem.
The motivation for the analysis of the rank minimization problem comes from the physical application of phase retrieval and a reformulation of the same as a
rank minimization problem. We show that, locally, the method of alternating projections must converge at linear rate to a solution of the rank
constrained affine feasibility problem. | de |