Hybrid methods for approximating Hankel matrix
From MaRDI portal
Publication:1870264
DOI10.1023/A:1022202125077zbMATH Open1017.65041OpenAlexW1828046956MaRDI QIDQ1870264FDOQ1870264
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5004921
- Hybrid methods for minimizing least-distance functions with semi-definite matrix constraints
- scientific article; zbMATH DE number 5124934
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Solving Hankel matrix approximation problem using semidefinite programming
alternating projectionsconvergencenumerical resultsHankel matrixNewton methodnon-smooth optimizationpositive semi-definite matrixleast distance functions
Cited In (13)
- Hybrid methods for minimizing least-distance functions with semi-definite matrix constraints
- Implementing Hager's exchange methods for matrix profile reduction
- Riemannian optimization methods for the truncated Takagi factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Hankel matrix approximation problem using semidefinite programming
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Title not available (Why is that?)
- Minimal condition number for positive definite Hankel matrices using semidefinite programming
- Stochastic approximation and realization of Hankel matrices
- A Lanczos bidiagonalization algorithm for Hankel matrices
- Global convergence of the alternating projection method for the max-cut relaxation problem
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
This page was built for publication: Hybrid methods for approximating Hankel matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870264)
