Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors

DOI10.1007/s11590-023-02032-6arXiv2207.07383OpenAlexW4382404638MaRDI QIDQ6124341

Yuning Yang, Xianpeng Mao

Publication date: 27 March 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.07383

zbMATH Keywords

tensorapproximation algorithmsparseapproximation bound\(\ell_1\) regularizationrank-1 approximation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
• Approximation bounds for sparse principal component analysis
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Tensor eigenvalues and their applications
• Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
• A sparse rank-1 approximation algorithm for high-order tensors
• The cubic spherical optimization problems
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• Probability Bounds for Polynomial Functions in Random Variables
• Provable Sparse Tensor Decomposition
• A Direct Formulation for Sparse PCA Using Semidefinite Programming

This page was built for publication: Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors