Monotonically convergent algorithms for symmetric tensor approximation
type: Item
instance of: scholarly article
title: Monotonically convergent algorithms for symmetric tensor approximation
zbMATH Open document ID: 1261.65043
author: Phillip A. Regalia
published in: Linear Algebra and its Applications
publication date: 2013-01-16T00:00:00Z
review text: The author considers the symmetric higher order power method for the rank-one approximation problem. In this respect, he presents extensions of these results to higher rank approximants of symmetric tensors, and establishes a simple stabilization method when a related functional is not convex.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 15A69
zbMATH DE Number: 6125895
zbMATH Keywords: tensor approximation
zbMATH Keywords: Tucker product
zbMATH Keywords: polar decomposition
zbMATH Keywords: convex gradient inequality
zbMATH Keywords: monotonic convergence
zbMATH Keywords: power methods
zbMATH Keywords: stabilization method
reviewed by: Constantin Popa
MaRDI profile type: Publication
full work available at URL: j.laa.2011.10.033
OpenAlex ID: W2115139877
cites work: Dykstras algorithm with bregman projections: A convergence proof
cites work: Q4821526
cites work: Q5580053
cites work: Q4936263
cites work: Maximal Rank of $m\times n\times(mn-k)$ Tensors
cites work: The number of eigenvalues of a tensor
cites work: Symmetric Tensors and Symmetric Tensor Rank
cites work: Generic and typical ranks of multi-way arrays
cites work: Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
cites work: A Multilinear Singular Value Decomposition
cites work: On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
cites work: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
cites work: On the Convergence of ICA Algorithms With Symmetric Orthogonalization
cites work: Fast low rank approximations of matrices and tensors
cites work: Tensor rank is NP-complete
cites work: On the history of the kronecker product
cites work: The vec-permutation matrix, the vec operator and Kronecker products: a review
cites work: Computing the Polar Decomposition—with Applications
cites work: Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
cites work: A parallel algorithm for computing the polar decomposition
cites work: Most Tensor Problems Are NP-Hard
cites work: Global properties of tensor rank
cites work: Generalized power method for sparse principal component analysis
cites work: Tensor approximation and signal processing applications
cites work: On the best rank-1 approximation of higher-order supersymmetric tensors
cites work: Orthogonal tensor decompositions
cites work: Tensor Decompositions and Applications
cites work: Shifted Power Method for Computing Tensor Eigenpairs
cites work: Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Properties of some blind equalization criteria in noisy multiuser environments
cites work: Q5599348
cites work: New criteria for blind deconvolution of nonminimum phase systems (channels)
cites work: The typical rank of tall three-way arrays
cites work: The ubiquitous Kronecker product
cites work: Rank-one approximation to high order tensors
DOI: 10.1016/J.LAA.2011.10.033
description: scientific article; zbMATH DE number 6125895