Metraipolis › archive › dc_fe87c4ffa45a
Jointly Sparse Blind Deconvolution via Riemannian Optimization — arXiv:2608.04465
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04465
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:38:25.996Z
- SHA-256 of the archived text
fd7acacffa5a7e6cde4833f7daf78913b4f33e88a020bfc982dfc474c42e97cf- Stable URL of this page
https://metraipolis.com/documento/dc_fe87c4ffa45a
How to cite
Jointly Sparse Blind Deconvolution via Riemannian Optimization — arXiv:2608.04465 — arXiv (en), https://arxiv.org/abs/2608.04465 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe87c4ffa45a (Metraipolis archive dc_fe87c4ffa45a, sha256 fd7acacffa5a7e6cde4833f7daf78913b4f33e88a020bfc982dfc474c42e97cf)
BibTeX
@misc{dcfe87c4ffa45a,
title = {Jointly Sparse Blind Deconvolution via Riemannian Optimization — arXiv:2608.04465},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04465},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe87c4ffa45a; sha256 fd7acacffa5a7e6cde4833f7daf78913b4f33e88a020bfc982dfc474c42e97cf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04465. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Blind deconvolution has been widely applied in system identification and signal processing. While joint sparsity commonly arises in practical scenarios, effectively exploiting this structure to enhance recovery performance remains a challenging and largely open problem. In this paper, we propose a joint-sparsity-promoting optimization problem and develop a Riemannian optimization algorithm for its accurate and efficient solution. We further establish theoretical guarantees that characterize the non-asymptotic relationship between the estimation error and the sample complexity, showing that exploiting joint sparsity can significantly reduce the sample complexity required for successful recovery. Numerical experiments are provided that validate the theoretical results and demonstrate the effectiveness of the proposed approach. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2608.04465 — 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-31T11:28:34.328Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).