Toeplitz matrix completion via a low-rank approximation algorithm
type: Item
instance of: scholarly article
title: Toeplitz matrix completion via a low-rank approximation algorithm
zbMATH Open document ID: 1503.15038
author: Yaru Fu
author: Ruiping Wen
published in: Journal of Inequalities and Applications
publication date: 2022-01-20T00:00:00Z
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 15B05
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 65F55
zbMATH DE Number: 7460846
zbMATH Keywords: matrix completion
zbMATH Keywords: Toeplitz matrix
zbMATH Keywords: low-rank
zbMATH Keywords: mean projection operator
describes a project that uses: RTRMC
describes a project that uses: LMaFit
MaRDI profile type: Publication
full work available at URL: s13660-020-02340-w
OpenAlex ID: W3030615137
cites work: Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
cites work: Spectral Compressed Sensing via Projected Gradient Descent
cites work: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
cites work: Robust Spectral Compressed Sensing via Structured Matrix Completion
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: A MODIFIED ORTHOGONAL RANK-ONE MATRIX PURSUIT FOR TOEPLITZ MATRIX COMPLETION
cites work: Q4917542
cites work: Functions of banded Hermitian block Toeplitz matrices in signal processing
cites work: Low-rank matrix completion using alternating minimization
cites work: Matrix Completion From a Few Entries
cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
cites work: Penalty decomposition methods for rank minimization
cites work: Q4422516
cites work: On the rank minimization problem over a positive semidefinite linear matrix inequality
cites work: Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
cites work: Low rank matrix completion by alternating steepest descent methods
cites work: Low-rank matrix completion by Riemannian optimization
cites work: Q4003887
cites work: A mean value algorithm for Toeplitz matrix completion
cites work: A structure-preserving algorithm for Toeplitz matrix completion
cites work: A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
cites work: Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
cites work: Q3307217
cites work: Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
cites work: A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion
cites work: The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
cites work: A fast symmetric SVD algorithm for square Hankel matrices
cites work: Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals
DOI: 10.1186/S13660-020-02340-W
description: scientific article; zbMATH DE number 7460846