Abstract
We study the solutions of infinite dimensional inverse problems over Banach spaces. The regularizer is defined as the total variation of a linear mapping of the function to recover, while the data fitting term is a near arbitrary function. The first contribution describes the solution’s structure: we show that under mild assumptions, there always exists an $m$-sparse solution, where $m$ is the number of linear measurements of the signal. Our second contribution is about the computation of the solution. While most existing works first discretize the problem, we show that exact solutions of the infinite dimensional problem can be obtained by solving one or two consecutive finite dimensional convex programs depending on the measurement functions structures. We finish by showing an application on scattered data approximation. These results extend recent advances in the understanding of total-variation regularized inverse problems.
Stochastic Dynamic Cutting Plane for Multistage Stochastic Convex Programs
