Rank-1 tensor properties with applications to a class of tensor optimization problems
From MaRDI portal
Publication:3465242
Recommendations
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- Symmetric rank-1 approximation of symmetric high-order tensors
- Best nonnegative rank-one approximations of tensors
Cites work
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- A Multilinear Singular Value Decomposition
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- A Singular Value Thresholding Algorithm for Matrix Completion
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Conditions for strong ellipticity and M-eigenvalues
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Eigenvalues of a real supersymmetric tensor
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low complexity damped Gauss-Newton algorithms for CANDECOMP/PARAFAC
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Maximum block improvement and polynomial optimization
- Most tensor problems are NP-hard
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
- Probability bounds for polynomial functions in random variables
- Quartic formulation of standard quadratic optimization problems
- Rank-one approximation to high order tensors
- Ranks derived from multilinear maps
- Shifted power method for computing tensor eigenpairs
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor Decompositions and Applications
- Tensor principal component analysis via convex optimization
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- Tensor-based techniques for the blind separation of DS-CDMA signals
- The cubic spherical optimization problems
- The number of eigenvalues of a tensor
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
Cited in
(17)- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Computing the largest C-eigenvalue of a tensor using convex relaxation
- On approximation algorithm for orthogonal low-rank tensor approximation
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- Some inequalities on the spectral radius of nonnegative tensors
- On decompositions and approximations of conjugate partial-symmetric tensors
- Unfoldings and the rank-one approximation of the tensor
- Tensor principal component analysis via convex optimization
- An approximation method of CP rank for third-order tensor completion
- Tensor rank, invariants, inequalities, and applications
- Best nonnegative rank-one approximations of tensors
- The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor
- Optimality conditions for Tucker low-rank tensor optimization
- Relaxation of the rank-1 tensor approximation using different norms
- On approximation algorithms for commutative quaternion polynomial optimization
- A locally convergent Jacobi iteration for the tensor singular value problem
This page was built for publication: Rank-1 tensor properties with applications to a class of tensor optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465242)
