Papers › The Lawson-Hanson Algorithm with Deviation Maximization: Finite Convergence and Sparse Recovery
The Lawson-Hanson Algorithm with Deviation Maximization: Finite Convergence and Sparse Recovery
Monica Dessole, Marco Dell'Orto, Fabio Marcuzzi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this work we apply the "deviation maximization", a new column selection strategy, to the Lawson-Hanson algorithm for the solution of NonNegative Least Squares (NNLS), devising a new algorithm we call Lawson-Hanson with Deviation Maximization (LHDM). This algorithm allows to exploit BLAS-3 operations, leading to higher performances. We show the finite convergence of this algorithm and explore the sparse recovery ability of LHDM. The results are presented with an extensive campaign of experiments, where we compare its performance against several ℓ₁-minimization solvers. An implementation of the proposed algorithm is available on a public repository.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections