期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 35, 期 3, 页码 1155-1179出版社
SIAM PUBLICATIONS
DOI: 10.1137/130935112
关键词
form; polynomial; relaxation; rank-1 approximation; semidefinite program; sum of squares; tensor
资金
- NSF [DMS-0844775]
This paper studies 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 multiquadratic forms over multispheres. We propose semidefinite relaxations, based on sum of squares representations, to solve these polynomial optimization problems. Their special properties and structures are studied. In applications, the resulting semidefinite programs are often large scale. The recent Newton-CG augmented Lagrangian method by Zhao, Sun, and Toh [SIAM J. Optim., 20 (2010), pp. 1737-1765] is suitable for solving these semidefinite relaxations. Extensive numerical experiments are presented to show that this approach is efficient in getting best rank-1 approximations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据