Approximate Toeplitz matrix problem using semidefinite programming
From MaRDI portal
Publication:2483033
DOI10.1007/s10957-007-9254-5zbMath1146.90045OpenAlexW2009017923MaRDI QIDQ2483033
Publication date: 5 May 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9254-5
Related Items
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- A successive projection method
- Moment problems and low rank Toeplitz approximations
- On the factorization of matrices
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- Sizing and Least-Change Secant Methods
- An Algorithm for Restricted Least Squares Regression
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A view of three decades of linear filtering theory
- On the Nesterov--Todd Direction in Semidefinite Programming
- SQP algorithms for solving Toeplitz matrix approximation problem
- Solving semidefinite programs using preconditioned conjugate gradients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item