A tightest convex envelope heuristic to row sparse and rank one matrices
GlobalSIP(2013)
摘要
The main result of this paper is providing a tight convex envelope to row sparse and rank one matrices which is of major interest in signal recovery applications. The resulting convexification turns out to be the ℓ1 norm of the matrix. This result highlights the fact that a joint convexification approach may not significantly improve the signal recovery process.
更多查看译文
关键词
signal recovery process,signal recovery applications,matrix algebra,row sparse,matrix,rank one matrices,convex programming,heuristic programming,convexification,tight convex envelope heuristic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要