Properties and methods for finding the best rank-one approximation to higher-order tensors
From MaRDI portal
Publication:2450904
DOI10.1007/s10589-013-9617-9zbMath1321.90134OpenAlexW2037049667MaRDI QIDQ2450904
Liqun Qi, Qingzhi Yang, Yuning Yang
Publication date: 23 May 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9617-9
algorithmstrong dualitynuclear norm regularizationnonnegative tensorsbest rank-one approximationZ-eigenvalue
Related Items
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors ⋮ Greedy Approaches to Symmetric Orthogonal Tensor Decomposition ⋮ Some bounds for the \(Z\)-eigenpair of nonnegative tensors
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Tensor Decompositions and Applications
- Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Perron-Frobenius theorem for nonnegative tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- Conditions for strong ellipticity and M-eigenvalues
- Algebraic connectivity of an even uniform hypergraph
- Block tensors and symmetric embeddings
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Tensor principal component analysis via convex optimization
- Eigenvalues of a real supersymmetric tensor
- Multiplier and gradient methods
- Quartic formulation of standard quadratic optimization problems
- Exact matrix completion via convex optimization
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Maximum Block Improvement and Polynomial Optimization
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Shifted Power Method for Computing Tensor Eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- 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
- The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On search directions for minimization algorithms
