A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion

DOI10.1007/s10444-016-9459-yzbMath1355.65061OpenAlexW2324338743MaRDI QIDQ503487

Chuan-Long Wang, Chao Li, Jin Wang

Publication date: 12 January 2017

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-016-9459-y

zbMATH Keywords

algorithmmatrix completionToeplitz matrixnumerical experimentmean valueaugmented Lagrange multiplier

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Toeplitz, Cauchy, and related matrices (15B05) Matrix completion problems (15A83)

Related Items

An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ 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
• Kronecker product approximations for image restoration with whole-sample symmetric boundary conditions
• Fixed point and Bregman iterative methods for matrix rank minimization
• Functions of banded Hermitian block Toeplitz matrices in signal processing
• Symbol approach in a signal-restoration problem involving block Toeplitz matrices
• 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
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Image restoration with shifting reflective boundary conditions
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion

This page was built for publication: A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion