Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
From MaRDI portal
Publication:2162522
DOI10.1007/s10898-022-01140-4zbMath1496.90098arXiv2012.03092OpenAlexW4214562664MaRDI QIDQ2162522
Publication date: 8 August 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.03092
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer ⋮ Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors
Uses Software
Cites Work
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Tensor Decompositions and Applications
- Approximation bounds for sparse principal component analysis
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Tensor eigenvalues and their applications
- A sparse rank-1 approximation algorithm for high-order tensors
- Tensor principal component analysis via convex optimization
- NP-hardness and inapproximability of sparse PCA
- The cubic spherical optimization problems
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- Consistent selection of the number of clusters via crossvalidation
- The Best Rank-One Approximation Ratio of a Tensor Space
- Shifted Power Method for Computing Tensor Eigenpairs
- Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tensor Decomposition for Signal Processing and Machine Learning
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- On Tensors, Sparsity, and Nonnegative Factorizations
- Optimal Sparse Singular Value Decomposition for High-Dimensional High-Order Data
- Dynamic Tensor Clustering
- Probability Bounds for Polynomial Functions in Random Variables
- Most Tensor Problems Are NP-Hard
- Provable Sparse Tensor Decomposition
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
This page was built for publication: Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors