Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Numerical optimization for symmetric tensor decomposition

Journal Article · · Mathematical Programming
 [1]
  1. Sandia National Lab. (SNL-CA), Livermore, CA (United States)

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on real-valued decompositions, both unconstrained and nonnegative. We discuss when solutions exist and how to formulate the mathematical program. Numerical results show the properties of the proposed formulations (including one that ignores symmetry) on a set of test problems and illustrate that these straightforward formulations can be effective even though the problem is nonconvex.

Research Organization:
Sandia National Lab. (SNL-CA), Livermore, CA (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1497638
Report Number(s):
SAND2014--18405J; 672377
Journal Information:
Mathematical Programming, Journal Name: Mathematical Programming Journal Issue: 1 Vol. 151; ISSN 0025-5610
Publisher:
SpringerCopyright Statement
Country of Publication:
United States
Language:
English

References (41)

Towards a standardized notation and terminology in multiway analysis journal January 2000
Scalable tensor factorizations for incomplete data journal March 2011
Monotonically convergent algorithms for symmetric tensor approximation journal January 2013
Scalable Tensor Factorizations with Missing Data conference December 2013
Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors journal January 2013
Symmetric tensors and symmetric tensor rank preprint January 2008
Symmetric tensor decomposition text January 2009
Eigenvectors of tensors and algorithms for Waring decomposition text January 2011
An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs text January 2014
A three-step algorithm for CANDECOMP/PARAFAC analysis of large data sets with multicollinearity journal May 1998
Towards a standardized notation and terminology in multiway analysis journal January 2000
On the uniqueness of multilinear decomposition ofN-way arrays journal January 2000
A scalable optimization approach for fitting canonical tensor decompositions journal January 2011
The Expression of a Tensor or a Polyadic as a Sum of Products journal April 1927
Multiple Invariants and Generalized Rank of a P-Way Matrix or Tensor journal April 1928
Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition journal September 1970
The Assumption of Proportional Components when Candecomp is Applied to Symmetric Matrices in the Context of Indscal journal January 2008
Recent developments in CANDECOMP/PARAFAC algorithms: a critical review journal January 2003
A comparison of algorithms for fitting the PARAFAC model journal April 2006
Eigenvalues of a real supersymmetric tensor journal December 2005
Computing symmetric rank for symmetric tensors journal January 2011
Eigenvectors of tensors and algorithms for Waring decomposition journal July 2013
Symmetric tensor decomposition journal December 2010
Singular Values and Eigenvalues of Tensors: A Variational Approach conference January 2005
Best rank (R, R, R) super-symmetric tensor approximation-a continuous-time approach conference January 1999
Efficiently Computing Tensor Eigenvalues on a GPU
  • Ballard, Grey; Kolda, Tamara; Plantenga, Todd
  • Distributed Processing, Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum https://doi.org/10.1109/IPDPS.2011.287
conference May 2011
Monotonic convergence of fixed-point algorithms for ICA journal July 2003
Symmetric Tensors and Symmetric Tensor Rank journal January 2008
Efficient MATLAB Computations with Sparse and Factored Tensors journal January 2008
Tensor Decompositions and Applications journal August 2009
Shifted Power Method for Computing Tensor Eigenpairs journal October 2011
Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors journal January 2013
Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm journal January 2014
Semidefinite Relaxations for Best Rank-1 Tensor Approximations journal January 2014
An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs journal January 2014
All Real Eigenvalues of Symmetric Tensors journal January 2014
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization journal January 2005
On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors journal January 2002
On the Best Rank-1 and Rank-( R 1 , R 2 ,. . ., R N ) Approximation of Higher-Order Tensors journal January 2000
Algorithm 862: MATLAB tensor classes for fast algorithm prototyping journal December 2006
An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors journal July 2013

Cited By (13)

Joint Embedding of Graphs journal April 2021
Low Rank Symmetric Tensor Approximations journal January 2017
Completely Positive Tensors and Multi-Hypergraphs preprint January 2015
On {0,1} CP Tensors and CP Multi-hypergraphs preprint January 2016
Validating Quantum-Classical Programming Models with Tensor Network Simulations text January 2018
Subspace power method for symmetric tensor decomposition and generalized PCA preprint January 2019
Symmetry Breaking in Symmetric Tensor Decomposition preprint January 2021
Separable symmetric tensors and separable anti-symmetric tensors preprint January 2022
Copositive tensor detection and its applications in physics and hypergraphs journal August 2017
Completely positive tensor recovery with minimal nuclear value journal April 2018
The sparsest solutions to Z-tensor complementarity problems journal February 2016
Validating quantum-classical programming models with tensor network simulations journal December 2018
The Sparsest Solutions to $Z$-Tensor Complementarity Problems preprint January 2015

Figures / Tables (10)


Similar Records

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
Journal Article · Wed Sep 16 00:00:00 EDT 2020 · SIAM Journal on Matrix Analysis and Applications · OSTI ID:1725841

Covariant decompositions of symmetric tensors in the theory of gravitation
Journal Article · Mon Dec 31 23:00:00 EST 1973 · Ann. Inst. Henri Poincare, Sect. A, v. 21, no. 4, pp. 319-332 · OSTI ID:4100327

Related Subjects