A class of weighted low rank approximation of the positive semidefinite Hankel matrix (Q305468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6620385 / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite Hankel matrix
Property / zbMATH Keywords: semidefinite Hankel matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
signal processing
Property / zbMATH Keywords: signal processing / rank
 
Normal rank
Property / zbMATH Keywords
 
unconstrained optimization
Property / zbMATH Keywords: unconstrained optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear conjugate gradient algorithm
Property / zbMATH Keywords: nonlinear conjugate gradient algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
Armijo line search
Property / zbMATH Keywords: Armijo line search / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical examples
Property / zbMATH Keywords: numerical examples / rank
 
Normal rank

Revision as of 23:53, 27 June 2023

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
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    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