Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
DOI10.1137/140983689zbMath1329.90114OpenAlexW2262986604MaRDI QIDQ3465242
Yuning Yang, Yun-Long Feng, Johan A. K. Suykens, Xiao Lin Huang
Publication date: 21 January 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/515906
convex relaxationnuclear normhigher order tensorrank-1 approximationbalanced unfoldingrank-1 equivalence property
Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- Ranks derived from multilinear maps
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Tensor-based techniques for the blind separation of DS-CDMA signals
- Conditions for strong ellipticity and M-eigenvalues
- The number of eigenvalues of a tensor
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Tensor principal component analysis via convex optimization
- On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
- Eigenvalues of a real supersymmetric tensor
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Quartic formulation of standard quadratic optimization problems
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- The cubic spherical optimization problems
- Maximum Block Improvement and Polynomial Optimization
- Hierarchical Singular Value Decomposition of Tensors
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor Spaces and Numerical Tensor Calculus
- Shifted Power Method for Computing Tensor Eigenpairs
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Probability Bounds for Polynomial Functions in Random Variables
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Most Tensor Problems Are NP-Hard
This page was built for publication: Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems