OCCVDec 6, 2022

Proximal methods for point source localisation

arXiv:2212.02991v47 citationsh-index: 21
Originality Incremental advance
AI Analysis

This work addresses a bottleneck in optimization for non-Hilbert spaces, offering incremental improvements over existing Frank-Wolfe methods.

The authors tackled the problem of point source localization by extending proximal-type optimization methods to spaces of measures, demonstrating their numerical efficacy.

Point source localisation is generally modelled as a Lasso-type problem on measures. However, optimisation methods in non-Hilbert spaces, such as the space of Radon measures, are much less developed than in Hilbert spaces. Most numerical algorithms for point source localisation are based on the Frank-Wolfe conditional gradient method, for which ad hoc convergence theory is developed. We develop extensions of proximal-type methods to spaces of measures. This includes forward-backward splitting, its inertial version, and primal-dual proximal splitting. Their convergence proofs follow standard patterns. We demonstrate their numerical efficacy.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes