Efficient Structured Matrix Rank Minimization

Abstract

We study the problem of finding structured low-rank matrices using nuclear norm regularization where the structure is encoded by a linear map. In contrast to most known approaches for linearly structured rank minimization, we do not (a) use the full SVD, nor (b) resort to augmented Lagrangian techniques, nor (c) solve linear systems per iteration. Instead, we formulate the problem differently so that it is amenable to a generalized conditional gradient method, which results in a practical improvement with low per iteration computational cost. Numerical results show that our approach significantly outperforms state-of-the-art competitors in terms of running time, while effectively recovering low rank solutions in stochastic system realization and spectral compressed sensing problems.

References in corpus (2)

• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Spectral Compressed Sensing via Structured Matrix Completion

Cited by in corpus (3)

• Interpretable PID Parameter Tuning for Control Engineering using General Dynamic Neural Networks: An Extensive Comparison
• Matrix Completion-Based Channel Estimation for MmWave Communication Systems With Array-Inherent Impairments
• Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms