Low-rank tensor completion by Riemannian optimization (Q398628): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors propose a variant of the nonlinear conjugate gradient method for solving the tensor completion problem that employs the framework Riemannian optimization techniques on the manifold of tensors of fixed multilinear rank. Some preliminary numerical results are reported to investigate the effectiveness of the proposed algorithm.
Property / review text: The authors propose a variant of the nonlinear conjugate gradient method for solving the tensor completion problem that employs the framework Riemannian optimization techniques on the manifold of tensors of fixed multilinear rank. Some preliminary numerical results are reported to investigate the effectiveness of the proposed algorithm. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Guo-Qiang Wang / 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: 15A83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A72 / 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: 6330855 / rank
 
Normal rank
Property / zbMATH Keywords
 
Tucker decomposition
Property / zbMATH Keywords: Tucker decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
Riemannian optimization
Property / zbMATH Keywords: Riemannian optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
low-rank approximation
Property / zbMATH Keywords: low-rank approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
high-dimensionality
Property / zbMATH Keywords: high-dimensionality / rank
 
Normal rank
Property / zbMATH Keywords
 
reconstruction
Property / zbMATH Keywords: reconstruction / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear conjugate gradient method
Property / zbMATH Keywords: nonlinear conjugate gradient method / rank
 
Normal rank
Property / zbMATH Keywords
 
tensor completion problem
Property / zbMATH Keywords: tensor completion problem / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical results
Property / zbMATH Keywords: numerical results / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank

Revision as of 16:52, 29 June 2023

scientific article
Language Label Description Also known as
English
Low-rank tensor completion by Riemannian optimization
scientific article

    Statements

    Low-rank tensor completion by Riemannian optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2014
    0 references
    The authors propose a variant of the nonlinear conjugate gradient method for solving the tensor completion problem that employs the framework Riemannian optimization techniques on the manifold of tensors of fixed multilinear rank. Some preliminary numerical results are reported to investigate the effectiveness of the proposed algorithm.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Tucker decomposition
    0 references
    Riemannian optimization
    0 references
    low-rank approximation
    0 references
    high-dimensionality
    0 references
    reconstruction
    0 references
    nonlinear conjugate gradient method
    0 references
    tensor completion problem
    0 references
    numerical results
    0 references
    algorithm
    0 references