Numerical optimization for symmetric tensor decomposition
Journal Article
·
· Mathematical Programming
- 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
Similar Records
Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
Covariant decompositions of symmetric tensors in the theory of gravitation
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