arXiv · 1605.05789
Optimization via Separated Representations and the Canonical Tensor Decomposition
Abstract
We introduce a new, quadratically convergent algorithm for finding maximum absolute value entries of tensors represented in the canonical format. The computational complexity of the algorithm is linear in the dimension of the tensor. We show how to use this algorithm to find global maxima of non-convex multivariate functions in separated form. We demonstrate the performance of the new algorithms on several examples.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Matthew J Reynolds, Gregory Beylkin, Alireza Doostan. 2016-05-19. Optimization via Separated Representations and the Canonical Tensor Decomposition. https://doi.org/10.1016/j.jcp.2017.07.012
Cite the original work for its findings. Save a collection to share your selection of sources.