An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem
From MaRDI portal
Publication:6051207
DOI10.1080/02331934.2022.2060828MaRDI QIDQ6051207
Cheng Ma, Unnamed Author, Xi-Hong Yan, Yi Xu
Publication date: 19 September 2023
Published in: Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- Fixed point and Bregman iterative methods for matrix rank minimization
- Positive semidefinite rank
- Worst-case results for positive semidefinite rank
- Convex multi-task feature learning
- The classical moment problem: Hilbertian proofs
- A remark on the rank of positive semidefinite matrices subject to affine constraints
- Two modified augmented Lagrange multiplier algorithms for Toeplitz matrix compressive recovery
- Low-rank matrix completion using nuclear norm minimization and facial reduction
- Moment problems and low rank Toeplitz approximations
- A mean value algorithm for Toeplitz matrix completion
- On a box-constrained linear symmetric cone optimization problem
- Exact matrix completion via convex optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Guaranteed Matrix Completion via Non-Convex Factorization
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Generalization of a theorem of Carathéodory
- Rank-preserving extensions of band matrices
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Minimal rank completions of partial banded matrices
- Hermitian and normal completions
- Inertias of Block Band Matrix Completions
- An Interior-Point Method for Semidefinite Programming