Tensor principal component analysis via convex optimization
From MaRDI portal
Publication:2340337
DOI10.1007/s10107-014-0774-0zbMath1312.65008arXiv1212.2702OpenAlexW2069287942MaRDI QIDQ2340337
Bo Jiang, Shi-Qian Ma, Shu-Zhong Zhang
Publication date: 16 April 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2702
tensornumerical examplesprincipal component analysisalternating direction method of multipliersnuclear normlow ranksemidefinite programming relaxation
Factor analysis and principal components; correspondence analysis (62H25) Semidefinite programming (90C22) Multilinear algebra, tensor calculus (15A69)
Related Items
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems, A note on semidefinite programming relaxations for polynomial optimization over a single sphere, On approximation algorithm for orthogonal low-rank tensor approximation, Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors, On norm compression inequalities for partitioned block tensors, An approximation method of CP rank for third-order tensor completion, The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor, A DCA-Newton method for quartic minimization over the sphere, Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual, Properties and methods for finding the best rank-one approximation to higher-order tensors, On decompositions and approximations of conjugate partial-symmetric tensors, Approximation algorithms for optimization of real-valued general conjugate complex forms, On cones of nonnegative quartic forms, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, Approximation methods for complex polynomial optimization, Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor, Computing the largest C-eigenvalue of a tensor using convex relaxation, Parallel matrix factorization for low-rank tensor completion
Uses Software
Cites Work
