The paper unifies the convex ingredients of ℓ0-penalized optimization into closed-form formulas and packages them in an open-source solver that outperforms existing exact solvers on several benchmarks.
Springer (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
The paper unifies the convex ingredients of ℓ0-penalized optimization into closed-form formulas and packages them in an open-source solver that outperforms existing exact solvers on several benchmarks.