Optimization via Separated Representations and the Canonical Tensor Decomposition
arXiv:1605.05789 · doi:10.1016/j.jcp.2017.07.012
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.
13 pages, 4 figures
Cited by in corpus (4)
- Fast Randomized Matrix and Tensor Interpolative Decomposition Using CountSketch
- Chemical accuracy from small, system-adapted basis functions
- Physics-Informed Tolerance Allocation: A Surrogate-Based Framework for the Control of Geometric Variation on System Performance
- Trefftz Functions for Nonlocal Electrostatics