Semidefinite Relaxations for Best Rank-1 Tensor Approximations
We study the problem of finding best rank-1 approximations for both symmetric and nonsymmetric tensors. For symmetric tensors, this is equivalent to optimizing homogeneous polynomials over unit spheres; for nonsymmetric tensors, this is equivalent to optimizing multi-quadratic forms over multi-spheres. We propose semidefinite relaxations, based on sum of squares representations, to solve these polynomial optimization problems. Some numerical experiments are presented to show that this approach is practical in getting best rank-1 approximations.
Tuesday, November 19, 2013
11:00AM AP&M 2402
Center for Computational Mathematics9500 Gilman Dr. #0112La Jolla, CA 92093-0112Tel: (858)534-9813