Solving Hankel matrix approximation problem using semidefinite programming
- 17 April 2006
- journal article
- Published by Elsevier BV in Journal of Computational and Applied Mathematics
- Vol. 202 (2), 304-314
- https://doi.org/10.1016/j.cam.2006.02.033
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Smallest eigenvalues of Hankel matrices for exponential weightsJournal of Mathematical Analysis and Applications, 2004
- Hybrid Methods for Approximating Hankel MatrixNumerical Algorithms, 2003
- NEOS and CondorACM Transactions on Mathematical Software, 2000
- The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinatesSIAM Journal on Matrix Analysis and Applications, 2000
- Sizing and Least-Change Secant MethodsSIAM Journal on Numerical Analysis, 1993
- The role of abstract algebra in structured estimation theoryIEEE Transactions on Information Theory, 1992
- Application of Toeplitz covariance estimation to adaptive beamforming and detectionIEEE Transactions on Signal Processing, 1991
- A successive projection methodMathematical Programming, 1988
- An Algorithm for Restricted Least Squares RegressionJournal of the American Statistical Association, 1983
- ACM Transactions on Mathematical Software, 1982