Hybrid methods for approximating Hankel matrix

DOI10.1023/A:1022202125077zbMath1017.65041OpenAlexW1828046956MaRDI QIDQ1870264

Suliman Al-Homidan

Publication date: 11 May 2003

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022202125077

zbMATH Keywords

convergencenumerical resultsHankel matrixNewton methodalternating projectionsnon-smooth optimizationpositive semi-definite matrixleast distance functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (4)

A class of weighted low rank approximation of the positive semidefinite Hankel matrix ⋮ Solving Hankel matrix approximation problem using semidefinite programming ⋮ Minimal condition number for positive definite Hankel matrices using semidefinite programming ⋮ Global convergence of the alternating projection method for the Max-Cut relaxation problem

This page was built for publication: Hybrid methods for approximating Hankel matrix