Metraipolis › archive › dc_8d85333140fc
Right Bregman proximal gradient with application to Poisson inverse problems * — arXiv:2610.06579
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06579
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T13:07:21.439Z
- SHA-256 of the archived text
3024e59cbbe6fa0a5797cd4e7a93d64cb1749bab8fd0f85d8f7c63f425b11097- Stable URL of this page
https://metraipolis.com/documento/dc_8d85333140fc
How to cite
Right Bregman proximal gradient with application to Poisson inverse problems * — arXiv:2610.06579 — arXiv (en), https://arxiv.org/abs/2610.06579 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8d85333140fc (Metraipolis archive dc_8d85333140fc, sha256 3024e59cbbe6fa0a5797cd4e7a93d64cb1749bab8fd0f85d8f7c63f425b11097)
BibTeX
@misc{dc8d85333140fc,
title = {Right Bregman proximal gradient with application to Poisson inverse problems * — arXiv:2610.06579},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06579},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8d85333140fc; sha256 3024e59cbbe6fa0a5797cd4e7a93d64cb1749bab8fd0f85d8f7c63f425b11097},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06579. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a novel Bregman proximal algorithm for convex composite optimization by applying the standard Bregman proximal gradient (BPG) method to a mirror-coordinate reparameterization of the objective. In primal variables, the resulting algorithm alternates between a preconditioned gradient step followed by a right Bregman proximal update. Our analysis relies on relative smoothness holding in the mirror coordinates instead of primal coordinates. Under this condition, we prove monotonic decrease of the objective in the general convex setting. We then specialize the method to Poisson inverse problems using weighted negative entropy as the potential. The resulting scheme recovers the classical Richardson-Lucy multiplicative updates and extends them to general convex regularizers. Building on a recent convergence analysis of multiplicative updates, we establish a sublinear convergence rate in function values for the Poisson setting. Finally, we demonstrate the performance of the regularized algorithm on several imaging inverse problems with Poisson-distributed observations. The code is publicly available at this https URL . Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Image and Video Processing (eess.IV) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.06579 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T11:21:31.946Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).