Cart
Create Account
Sign In
Collection:
We propose a novel approach to solve exactly the sparse nonnegative least squares problem, under hard l0 sparsity constraints. This approach is based on a dedicated branch-and-bound algorithm. This simple strategy is able to compute the optimal solution e
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Videos in this product
Exact Sparse Nonnegative Least Squares
We propose a novel approach to solve exactly the sparse nonnegative least squares problem, under hard l0 sparsity constraints. This approach is based on a dedicated branch-and-bound algorithm. This simple strategy is able to compute the optimal solution e