12 citations · 15 across the 2 of their papers we have counts for
2 papers
math.SP2015★ 12 cited
The Sparsest Solutions to -Tensor Complementarity Problems
Ziyan Luo, Liqun Qi, Naihua Xiu
Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved norm. In this paper, a sp…
cs.IT2011★ 3 cited
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery
Lingchen Kong, Levent Tunçel, Naihua Xiu
The low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statisti…