Proximal methods for point source localisation

Abstract

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.

References in corpus (7)

• The Sliding Frank-Wolfe Algorithm and its Application to Super-Resolution Microscopy
• On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
• On the linear convergence rates of exchange and continuous methods for total variation minimization
• An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
• A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
• Testing and non-linear preconditioning of the proximal point method
• First-order primal-dual methods for nonsmooth nonconvex optimisation

Cited by in corpus (1)

• Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation