Minimal condition number for positive definite Hankel matrices using semidefinite programming
DOI10.1016/J.LAA.2010.04.052zbMATH Open1209.65050OpenAlexW2038696008WikidataQ114851463 ScholiaQ114851463MaRDI QIDQ989049FDOQ989049
Authors: Suliman Al-Homidan, M. M. Alshahrani, Cosmin Petra, Florian A. Potra 
Publication date: 27 August 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.052
Recommendations
- Positive definite Hankel matrices of minimal condition
- A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
- Minimizing the condition number of a positive definite matrix by completion
- Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
- Solving Hankel matrix approximation problem using semidefinite programming
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Positive definite matrix approximation with condition number constraint
- scientific article; zbMATH DE number 4016066
- Minimum norm solution to the positive semidefinite linear complementarity problem
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
Semidefinite programming (90C22) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Toeplitz, Cauchy, and related matrices (15B05)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- Positive definite Hankel matrices of minimal condition
- Hybrid methods for approximating Hankel matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- How bad are Hankel matrices?
- On homogeneous interrior-point algorithms for semidefinite programming
- Title not available (Why is that?)
- Positive definite Hankel matrices using Cholesky factorization
- Title not available (Why is that?)
- Solving Hankel matrix approximation problem using semidefinite programming
- Stable factorization for Hankel and Hankel‐like matrices
Cited In (5)
- A note on a lower bound on the minimum rank of a positive semidefinite Hankel matrix rank minimization problem
- Solving Hankel matrix approximation problem using semidefinite programming
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Positive definite Hankel matrices of minimal condition
- Positive definite Hankel matrices using Cholesky factorization
Uses Software
This page was built for publication: Minimal condition number for positive definite Hankel matrices using semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989049)
