DeepAI AI Chat
Log In Sign Up

A Low-Rank Approach to Off-The-Grid Sparse Deconvolution

by   Paul Catala, et al.

We propose a new solver for the sparse spikes deconvolution problem over the space of Radon measures. A common approach to off-the-grid deconvolution considers semidefinite (SDP) relaxations of the total variation (the total mass of the absolute value of the measure) minimization problem. The direct resolution of this SDP is however intractable for large scale settings, since the problem size grows as f_c^2d where f_c is the cutoff frequency of the filter and d the ambient dimension. Our first contribution introduces a penalized formulation of this semidefinite lifting, which has low-rank solutions. Our second contribution is a conditional gradient optimization scheme with non-convex updates. This algorithm leverages both the low-rank and the convolutive structure of the problem, resulting in an O(f_c^d f_c) complexity per iteration. Numerical simulations are promising and show that the algorithm converges in exactly r steps, r being the number of Diracs composing the solution.


Barrier and penalty methods for low-rank semidefinite programming with application to truss topology design

The aim of this paper is to solve large-and-sparse linear Semidefinite P...

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

We present a sublinear query algorithm for outputting a near-optimal low...

Low-Rank and Total Variation Regularization and Its Application to Image Recovery

In this paper, we study the problem of image recovery from given partial...

Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

This paper concerns a fundamental class of convex matrix optimization pr...

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach

We study the Sparse Plus Low Rank decomposition problem (SLR), which is ...

A decoupled form of the structure-preserving doubling algorithm with low-rank structures

The structure-preserving doubling algorithm (SDA) is a fairly efficient ...

The dimension of an orbitope based on a solution to the Legendre pair problem

The Legendre pair problem is a particular case of a rank-1 semidefinite ...