Nicolas Nadisic

Exact Sparse Nonnegative Least Squares

We propose a novel approach to solve exactly the sparse nonnegative least squares problem, under hard ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> sparsity constraints. This approach is based on a dedicated branch-and-bound algorithm. This…