Solving Hankel matrix approximation problem using semidefinite programming (Q875374)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving Hankel matrix approximation problem using semidefinite programming |
scientific article |
Statements
Solving Hankel matrix approximation problem using semidefinite programming (English)
0 references
13 April 2007
0 references
The author studies the problem of finding the nearest matrix to a positive semidefinite Hankel matrix in such a way that all the special properties are preserved. In the usual evaluation techniques rounding and truncation limitations result in some of the properties to be lost. The author describes a semidefinite programming optimization problem, the solution of which can produce a suitable matrix. The proposed algorithm is presented in detail (section 4) and the results of the computational experimentation are reported at the end of the article.
0 references
Hankel matrix
0 references
semidefinite programming
0 references
primal-dual interior-point algorithm
0 references
numerical examples
0 references
nearest matrix
0 references
algorithm
0 references