Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function

IEEE Transactions on Signal Processing - United States
doi 10.1109/tsp.2013.2295557
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2001English

Recovery of Corrupted Low-Rank Tensors

Applied Mathematics
2017English

On the Compression of Low Rank Matrices

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2005English

Rank Three Affine Planes

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

Multi-Cancer Samples Clustering via Graph Regularized Low-Rank Representation Method Under Sparse and Symmetric Constraints

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2019English

Why Are Big Data Matrices Approximately Low Rank?

SIAM Journal on Mathematics of Data Science
2019English

S-Goodness for Low-Rank Matrix Recovery

Abstract and Applied Analysis
Applied MathematicsAnalysis
2013English

Uniqueness Conditions for Low-Rank Matrix Recovery

2011English

Hyperspectral Image Compressed Sensing via Low-Rank and Joint-Sparse Matrix Recovery

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy