Solving Hankel matrix approximation problem using semidefinite programming
DOI10.1016/J.CAM.2006.02.033zbMATH Open1117.65083OpenAlexW1977701268MaRDI QIDQ875374FDOQ875374
Authors: Suliman Al-Homidan 
Publication date: 13 April 2007
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.02.033
Recommendations
- scientific article; zbMATH DE number 5004921
- scientific article; zbMATH DE number 5124934
- Approximate Toeplitz matrix problem using semidefinite programming
- Hybrid methods for approximating Hankel matrix
- scientific article; zbMATH DE number 1086779
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Minimal condition number for positive definite Hankel matrices using semidefinite programming
- Approximation and realization of Hankel matrices
- Semi-definite programming for the nearest circulant semi-definite matrix problem
- Hankel norm approximation for well-posed linear systems
numerical examplesalgorithmsemidefinite programmingHankel matrixnearest matrixprimal-dual interior-point algorithm
Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semidefinite programming (90C22)
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?)
- Functional Operators (AM-22), Volume 2
- Sizing and Least-Change Secant Methods
- An Algorithm for Restricted Least Squares Regression
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low rank approximation of a Hankel matrix by structured total least norm
- A successive projection method
- Hybrid methods for approximating Hankel matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Nesterov--Todd Direction in Semidefinite Programming
- The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinates
- On the factorization of matrices
- Title not available (Why is that?)
- Smallest eigenvalues of Hankel matrices for exponential weights
- Solving semidefinite programs using preconditioned conjugate gradients
- The role of abstract algebra in structured estimation theory
- Title not available (Why is that?)
Cited In (11)
- Computing the nearest circulant positive semi-definite matrix to a noisy matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operator equations inducing some generalizations of slant Hankel operators
- Minimal condition number for positive definite Hankel matrices using semidefinite programming
- Semi-definite programming for the nearest circulant semi-definite matrix problem
- On computing nearest singular Hankel matrices
- Hybrid methods for approximating Hankel matrix
- Semidefinite programming for the nearest Hurwitz semidefinite matrix problem
- Slant Hankel operators of multivariate order
- Projection Methods in Conic Optimization
Uses Software
This page was built for publication: Solving Hankel matrix approximation problem using semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875374)
