A class of weighted low rank approximation of the positive semidefinite Hankel matrix (Q305468): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2015/937573 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092674423 / rank | |||
Normal rank | |||
Revision as of 22:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of weighted low rank approximation of the positive semidefinite Hankel matrix |
scientific article |
Statements
A class of weighted low rank approximation of the positive semidefinite Hankel matrix (English)
0 references
30 August 2016
0 references
Summary: We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem arising in signal processing. By using the Vandermonde representation, we firstly transform the problem into an unconstrained optimization problem and then use the nonlinear conjugate gradient algorithm with the Armijo line search to solve the equivalent unconstrained optimization problem. Numerical examples illustrate that the new method is feasible and effective.
0 references
semidefinite Hankel matrix
0 references
signal processing
0 references
unconstrained optimization
0 references
nonlinear conjugate gradient algorithm
0 references
Armijo line search
0 references
numerical examples
0 references
