A mean value algorithm for Toeplitz matrix completion

DOI10.1016/j.aml.2014.10.013zbMath1312.15037OpenAlexW2018834527MaRDI QIDQ2343788

Chuan-Long Wang, Chao Li

Publication date: 6 May 2015

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2014.10.013

zbMATH Keywords

matrix completionToeplitz matrixmean value

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Matrix completion problems (15A83)

Related Items

Unnamed Item ⋮ An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ Matrix completion for matrices with low-rank displacement ⋮ Comparisons of several algorithms for Toeplitz matrix recovery ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Toeplitz matrix completion via a low-rank approximation algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Functions of banded Hermitian block Toeplitz matrices in signal processing
• A fast symmetric SVD algorithm for square Hankel matrices
• Fast singular value thresholding without singular value decomposition
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion

This page was built for publication: A mean value algorithm for Toeplitz matrix completion