Approximate Toeplitz matrix problem using semidefinite programming
From MaRDI portal
Publication:2483033
DOI10.1007/S10957-007-9254-5zbMATH Open1146.90045OpenAlexW2009017923MaRDI QIDQ2483033FDOQ2483033
Authors: Yanyan Li
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
Recommendations
- Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- SQP algorithms for solving Toeplitz matrix approximation problem
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
- Finding the closest Toeplitz matrix
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Solving semidefinite-quadratic-linear programs using SDPT3
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sizing and Least-Change Secant Methods
- An Algorithm for Restricted Least Squares Regression
- Title not available (Why is that?)
- A successive projection method
- Moment problems and low rank Toeplitz approximations
- On the Nesterov--Todd Direction in Semidefinite Programming
- Title not available (Why is that?)
- On the factorization of matrices
- Title not available (Why is that?)
- A view of three decades of linear filtering theory
- Solving semidefinite programs using preconditioned conjugate gradients
- Title not available (Why is that?)
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- SQP algorithms for solving Toeplitz matrix approximation problem
Cited In (13)
- Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
- Title not available (Why is that?)
- Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
- Computing the nearest circulant positive semi-definite matrix to a noisy matrix
- Solving Hankel matrix approximation problem using semidefinite programming
- Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem
- Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
- Semi-definite programming for the nearest circulant semi-definite matrix problem
- Semidefinite programming for the nearest Hurwitz semidefinite matrix problem
- On projection of a positive definite matrix on a cone of nonnegative definite Toeplitz matrices
- Finding the closest Toeplitz matrix
- Approximate Semidefinite Matrices in a Linear Variety
- SQP algorithms for solving Toeplitz matrix approximation problem
Uses Software
This page was built for publication: Approximate Toeplitz matrix problem using semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483033)