Exact matrix completion based on low rank Hankel structure in the Fourier domain

DOI10.1016/j.acha.2021.05.002zbMath1472.15038arXiv1910.02576OpenAlexW3161378388MaRDI QIDQ1979919

Ke Wei, Jinchi Chen, Weiguo Gao

Publication date: 3 September 2021

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.02576

zbMATH Keywords

matrix completionFourier domainHankel structure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Matrix completion problems (15A83)

Related Items

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion

Uses Software

• SDPT3
• CVX
• PDCO
• tproduct

Cites Work

• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• Factorization strategies for third-order tensors
• User-friendly tail bounds for sums of random matrices
• Theory of semidefinite programming for sensor network localization
• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• Convex multi-task feature learning
• Characterization of the subdifferential of some matrix norms
• Painless breakups -- efficient demixing of low rank matrices
• Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
• One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Exact matrix completion via convex optimization
• Atomic Decomposition by Basis Pursuit
• Low-Rank Matrix Completion by Riemannian Optimization
• The power and Arnoldi methods in an algebra of circulants
• Incoherence-Optimal Matrix Completion
• Robust Spectral Compressed Sensing via Structured Matrix Completion
• Compressive Sampling Using Annihilating Filter-Based Low-Rank Interpolation
• Hierarchical Singular Value Decomposition of Tensors
• Graph Implementations for Nonsmooth Convex Programs
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Blind Demixing and Deconvolution at Near-Optimal Rate
• Model Consistency of Partly Smooth Regularizers
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• Exact Tensor Completion Using t-SVD
• Spectral Compressed Sensing via Projected Gradient Descent
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
• Compressed Sensing Off the Grid
• Sampling signals with finite rate of innovation
• Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
• A Simpler Approach to Matrix Completion
• Third-order tensors as linear operators on a space of matrices

This page was built for publication: Exact matrix completion based on low rank Hankel structure in the Fourier domain