Metraipolis › archive › dc_67e0e89bc426

Sparse descent subspace-Newton thresholding algorithm for sparse optimization problems — arXiv:2610.41318

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41318
License (as archived)
CC0-1.0
Archived
2026-11-03T08:15:52.504Z
SHA-256 of the archived text
2a48670cb1ba0e5823abb4c421348e88b55b18ffff11736dd96a307cee26f31a
Stable URL of this page
https://metraipolis.com/documento/dc_67e0e89bc426

How to cite

Sparse descent subspace-Newton thresholding algorithm for sparse optimization problems — arXiv:2610.41318 — arXiv (en), https://arxiv.org/abs/2610.41318 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67e0e89bc426 (Metraipolis archive dc_67e0e89bc426, sha256 2a48670cb1ba0e5823abb4c421348e88b55b18ffff11736dd96a307cee26f31a)
BibTeX
@misc{dc67e0e89bc426,
  title = {Sparse descent subspace-Newton thresholding algorithm for sparse optimization problems — arXiv:2610.41318},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41318},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67e0e89bc426; sha256 2a48670cb1ba0e5823abb4c421348e88b55b18ffff11736dd96a307cee26f31a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41318. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we propose a sparse descent direction derived from the Newton direction within a low-dimensional subspace for sparse optimization problems. Building upon this direction and incorporating hard thresholding and orthogonal projection, we develop a novel algorithm termed the sparse descent subspace-Newton thresholding (SDSNT) algorithm. We further establish its global convergence under the restricted isometry property $\delta_{3k}\leq \sqrt{3/20}$ of the measurement matrix. Numerical experiments on random sparse vector recovery and audio signal reconstruction reveal that SDSNT achieves comparable performance to several state-of-the-art algorithms. Notably, relative to most of them, it delivers superior recovery at high sparsity levels and improved efficiency at low sparsity levels.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.41318 — 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-11-03T08:04:23.893Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).