Toeplitz matrix completion via a low-rank approximation algorithm
From MaRDI portal
Publication:2069350
DOI10.1186/s13660-020-02340-wzbMath1503.15038OpenAlexW3030615137MaRDI QIDQ2069350
Publication date: 20 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-020-02340-w
Eigenvalues, singular values, and eigenvectors (15A18) Toeplitz, Cauchy, and related matrices (15B05) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
- Functions of banded Hermitian block Toeplitz matrices in signal processing
- Low rank matrix completion by alternating steepest descent methods
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
- A mean value algorithm for Toeplitz matrix completion
- A fast symmetric SVD algorithm for square Hankel matrices
- Low-Rank Matrix Completion by Riemannian Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Penalty decomposition methods for rank minimization
- A MODIFIED ORTHOGONAL RANK-ONE MATRIX PURSUIT FOR TOEPLITZ MATRIX COMPLETION
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals
- Spectral Compressed Sensing via Projected Gradient Descent
- A structure-preserving algorithm for Toeplitz matrix completion
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- Matrix Completion From a Few Entries
- Low-rank matrix completion using alternating minimization
This page was built for publication: Toeplitz matrix completion via a low-rank approximation algorithm