The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction
The problem of finding a sparse solution for linear equations has been investigated extensively in recent years. This is an NP-hard combinatorial problem, and one popular method is to relax such combinatorial requirement into an approximated convex problem, which can avoid the computational complexi...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/15730 |