arbiter
JournalsAccount

ℓ1-2 Regularization for Sparse Optimization: Consistency and Global Convergence

Yaohua Hu et al.

Mathematics of Operations Research2026https://doi.org/10.1287/moor.2025.1095article
AJG 3ABDC A
Weight
0.50

Abstract

The [Formula: see text] regularization method has a strong sparsity-promoting capability in approaching sparse solutions of linear inverse problems and gains successful applications in various mathematics disciplines and applied science fields. This paper aims to investigate the consistency theory and global convergent algorithms for the [Formula: see text] regularization problem. In the theoretical aspect, we introduce a notion of restricted eigenvalue condition relative to the [Formula: see text] penalty and employ it to establish an oracle property and a recovery bound for the global solution of the [Formula: see text] regularization problem. In the algorithmic aspect, we propose two types of iterative thresholding algorithms with the truncation technique and the continuation technique, respectively, to solve the [Formula: see text] regularization problem. Moreover, under the assumption of the well-known restricted isometry property, we establish the convergence of the proposed algorithms to the ground true sparse solution within a tolerance relevant to the noise level and the recovery bound. Preliminary numerical results verify our theoretical convergence results in showing that the proposed algorithms can approach the ground true sparse solution and significantly enhance the sparsity recovery capability, compared with the popular sparse optimization algorithms in the literature. Funding: This work was supported by the National Outstanding Youth Foundation of China [Grant 12222112]. Y. Hu’s work is supported by the National Key Research and Development Program of China [Grant 2025YFA1016903], Shenzhen Medical Research Fund [Grant B2502001], National Natural Science Foundation of China [Grants 12571327 and 12426311], Project of Educational Commission of Guangdong Province [Grant 2025ZDZX2059], and Shenzhen Science and Technology Program [Grants RCJC20221008092753082 and JCYJ20241202124209011]. H. Wang’s work is supported by the National Natural Science Foundation of China [Grant 12571326]. X. Yang’s work is supported by the Research Grants Council of Hong Kong [Grants PolyU 15205223 and N_PolyU507/22] and an internal grant [Grant 4-ZZPP].

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1287/moor.2025.1095

Or copy a formatted citation

@article{yaohua2026,
  title        = {{ℓ1-2 Regularization for Sparse Optimization: Consistency and Global Convergence}},
  author       = {Yaohua Hu et al.},
  journal      = {Mathematics of Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1287/moor.2025.1095},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

ℓ1-2 Regularization for Sparse Optimization: Consistency and Global Convergence

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.