Hybrid methods for approximating Hankel matrix
From MaRDI portal
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
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
- scientific article; zbMATH DE number 5004921 (Why is no real title available?)
- scientific article; zbMATH DE number 5124934 (Why is no real title available?)
- A class of weighted low rank approximation of the positive semidefinite Hankel matrix
- Solving Hankel matrix approximation problem using semidefinite programming
- scientific article; zbMATH DE number 2206697 (Why is no real title available?)
- 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)
