Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Journal of Nonsmooth Analysis and Optimization logo
Journal of Nonsmooth Analysis and Optimization
Journal of Nonsmooth Analysis and Optimization logo
Journal of Nonsmooth Analysis and Optimization
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeAuthors
About
The journalNewsStatistics
Boards
Publish
For authorsEthical charter
Submit
Journal of Nonsmooth Analysis and Optimization logo
Contact
|
Credits
eISSN 2700-7448
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Proximal methods for ...
Article

Proximal methods for point source localisation

Tuomo Valkonen
Download article
Open on arXiv
Submitted on
December 7, 2022
Accepted on
September 20, 2023
Published on
September 21, 2023
Last modified on
September 21, 2023
Volume 4
Volume 4
Original research articles
DOI
10.46298/jnsao-2023-10433
License
Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
Research Council of Finland
314701
Decoupling preconditioners for non-smooth optimisation and inverse problems
Indicators
778
Views
616
Downloads

Proximal methods for point source localisation

Tuomo Valkonen
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.
Keywords
  • Mathematics - Optimization and Control
  • Computer Science - Computer Vision and Pattern Recognition
Mathematics Subject Classification 2020
  • 49M29 - Numerical methods involving duality
  • 49N45 - Inverse problems in optimal control
  • 90C48 - Programming in abstract spaces
Linked publications - datasets - software
  • Is based for
    https://doi.org/10.5281/zenodo.7402055
Cited by

Source: OpenCitations

  • Off-the-grid regularisation for Poisson inverse problems

    Computational Optimization and Applications

    Authors : Marta Lazzaretti ORCID, Claudio Estatico ORCID, Alejandro Melero ORCID, Luca Calatroni ORCID

    Journal reference : Volume 91, 2025, pp. 827-860

    DOI : 10.1007/s10589-025-00688-7
Preview
Loading PDF preview...