This video program is a part of the Premium package:

### A Greedy Sparse Approximation Algorithm Based On L1-Norm Selection Rules

• IEEE MemberUS $11.00 • Society MemberUS$0.00
• IEEE Student MemberUS $11.00 • Non-IEEE MemberUS$15.00

# A Greedy Sparse Approximation Algorithm Based On L1-Norm Selection Rules

0 views
We propose a new greedy sparse approximation algorithm, called SLS for {\it Single L1 Selection}, that addresses a least-squares optimization problem under a cardinality constraint. The specificity and the increased efficiency of SLS originates from its s
We propose a new greedy sparse approximation algorithm, called SLS for {\it Single L1 Selection}, that addresses a least-squares optimization problem under a cardinality constraint. The specificity and the increased efficiency of SLS originates from its s