Non-Convex Methods for Compressed Sensing and Low-Rank Matrix Problems

Daniele Gerosa

Forskningsoutput: AvhandlingDoktorsavhandling (sammanläggning)

156 Nedladdningar (Pure)


In this thesis we study functionals of the type \( \mathcal{K}_{f,A,\b}(\x)= \mathcal{Q}(f)(\x) + \|A\x - \b \| ^2 \), where \(A\) is a linear map, \(\b\) a measurements vector and \( \mathcal{Q} \) is a functional transform called \emph{quadratic envelope}; this object is a very close relative of the \emph{Lasry-Lions envelope} and its use is meant to regularize the functionals \(f\). Carlsson and Olsson investigated in earlier works the connections between the functionals \( \mathcal{K}_{f,A,\b}\) and their unregularized counterparts \(f(\x) + \|A\x - \b \| ^2 \). For certain choices of \(f\) the penalty \( \mathcal{Q}(f)(\cdot)\) acts as sparsifying agent and the minimization of \( \mathcal{K}_{f,A,\b}(\x) \) delivers sparse solutions to the linear system of equations \( A\x = \b \). We prove existence and uniqueness results of the sparse (or low rank, since the functional \(f\) can have any Hilbert space as domain) global minimizer of \( \mathcal{K}_{f,A,\b}(\x) \) for some instances of \(f\), under Restricted Isometry Property conditions on \(A\). The theory is complemented with robustness results and a wide range of numerical experiments, both synthetic and from real world problems.
  • Carlsson, Marcus, handledare
Tilldelningsdatum2022 apr. 26
ISBN (tryckt)978-91-8039-088-0
ISBN (elektroniskt)978-91-8039-087-3
StatusPublished - 2022

Bibliografisk information

Defence details
Date: 2022-04-26
Time: 15:00
Place: Matematikcentrum, Lunds universitet, Sölvegtan 18, Lund. Join via zoom:
External reviewer(s)
Name: Skovgaard Andersen, Martin
Title: Associate Professor
Affiliation: Department of Applied Mathematics and Computer Science, Technical University of Denmark.

Ämnesklassifikation (UKÄ)

  • Matematisk analys


Utforska forskningsämnen för ”Non-Convex Methods for Compressed Sensing and Low-Rank Matrix Problems”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här