Sparse recovery on Euclidean Jordan algebras
Access Status
Authors
Date
2015Collection
Type
Metadata
Show full item recordAbstract
This paper is concerned with the problem of sparse recovery on Euclidean Jordan algebra (SREJA), which includes the sparse signal recovery problem and the low-rank symmetric matrix recovery problem as special cases. We introduce the notions of restricted isometry property (RIP), null space property (NSP), and s-goodness for linear transformations in s-SREJA, all of which provide sufficient conditions for s-sparse recovery via the nuclear norm minimization on Euclidean Jordan algebra. Moreover, we show that both the s-goodness and the NSP are necessary and sufficient conditions for exact s-sparse recovery via the nuclear norm minimization on Euclidean Jordan algebra. Applying these characteristic properties, we establish the exact and stable recovery results for solving SREJA problems via nuclear norm minimization.
Citation
Source Title
Department
Remarks
NOTICE: This is the author’s version of a work that was accepted for publication in Linear Algebra and its Applications. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Linear Algebra and its Applications, Vol. 465 (2015). http://dx.doi.org/10.1016/j.laa.2014.09.018
Related items
Showing items related by title, author, creator and subject.
-
Zhang, X.; Pham, DucSon; Phung, D.; Liu, Wan-Quan; Saha, B.; Venkatesh, S. (2015)Many vision problems deal with high-dimensional data, such as motion segmentation and face clustering. However, these high-dimensional data usually lie in a low-dimensional structure. Sparse representation is a powerful ...
-
Zhang, X.; Pham, DucSon; Venkatesh, S.; Liu, Wan-Quan; Phung, D. (2015)Face recognition with multiple views is a challenging research problem. Most of the existing works have focused on extracting shared information among multiple views to improve recognition. However, when the pose variation ...
-
Qiu, H.; Chen, Xiaoming; Liu, W.; Zhou, Guanglu; Wang, Y.; Lai, J. (2012)In this paper we apply a recently proposed Lagrange Dual Method (LDM) to design a new Sparse Representation-based Classification (LDM-SRC) algorithm for robust face recognition problem. The proposed approach improves the ...