Cart
Create Account
Sign In
Already purchased this program?
Login to View
This video program is a part of the Premium package:
Robust Matrix Completion Via Lp-Greedy Pursuits
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Robust Matrix Completion Via Lp-Greedy Pursuits
A novel $ell_p$-greedy pursuit (GP) algorithm for robust matrix completion, i.e., recovering a low-rank matrix from only a subset of its noisy and outlier-contaminated entries, is devised. The $ell_p$-GP uses the strategy of sequential rank-one update.
A novel $ell_p$-greedy pursuit (GP) algorithm for robust matrix completion, i.e., recovering a low-rank matrix from only a subset of its noisy and outlier-contaminated entries, is devised. The $ell_p$-GP uses the strategy of sequential rank-one update.
