EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization

Yaohua Hu, Xinlin Hu, Xiaoqi Yang

Mathematical Programming · 2025-05 · 211 (1-2) · 181-206

DOI: 10.1007/s10107-024-02068-1 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Programming, online erschienen am 06.03.2024. Verfasst von Yaohua Hu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Hong Kong Polytechnic University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper aims to find an approximate true sparse solution of an underdetermined linear system. For this purpose, we propose two types of iterative thresholding algorithms with the continuation technique and the truncation technique respectively. We introduce a notion of limited shrinkage thresholding operator and apply it, together with the restricted isometry property, to show that the proposed algorithms converge to an approximate true sparse solution within a tolerance relevant to the noise level and the limited shrinkage magnitude. Applying the obtained results to nonconvex regularization problems with SCAD, MCP and $$\ell _p$$ ℓ p penalty ( $$0\le p \le 1$$ 0 ≤ p ≤ 1 ) and utilizing the recovery bound theory, we establish the convergence of their proximal gradient algorithms to an approximate global solution of nonconvex regularization problems. The established results include the existing convergence theory for $$\ell _1$$ ℓ 1 or $$\ell _0$$ ℓ 0 regularization problems for finding a true sparse solution as special cases. Preliminary numerical results show that our proposed algorithms can find approximate true sparse solutions that are much better than stationary solutions that are found by using the standard proximal gradient algorithm.

Förderung

  • Hong Kong Polytechnic University

Zitieren

APA

Hu, Y., Hu, X., & Yang, X. (2025). On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. Mathematical Programming, 211(1-2), 181-206. https://doi.org/10.1007/s10107-024-02068-1

Vancouver

Hu Y, Hu X, Yang X. On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. Mathematical Programming. 2025;211(1-2):181-206. doi:10.1007/s10107-024-02068-1

BibTeX
@article{Hu2025,
  author = {Hu, Yaohua and Hu, Xinlin and Yang, Xiaoqi},
  title = {On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization},
  journal = {Mathematical Programming},
  year = {2025},
  volume = {211},
  number = {1-2},
  pages = {181--206},
  doi = {10.1007/s10107-024-02068-1}
}
Kostenlos starten →