most citedSeveral Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order Tensors

4 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.OC2022

Practical Approximation Algorithms for -Regularized Sparse Rank- Approximation to Higher-Order Tensors

Xianpeng Mao, Yuning Yang

Two approximation algorithms are proposed for -regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on multilinear relaxation and spars…

math.OC2022

Computation over Tensor Stiefel Manifold: A Preliminary Study

Xianpeng Mao, Ying Wang, Yuning Yang

Let denote the t-product between two third-order tensors. The purpose of this work is to study fundamental computation over the set $St(n,p,l):= \{\mathcal Q\in \mathbb R^{n\ti…

math.NA2020★ 4 cited

Several Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order Tensors

Xianpeng Mao, Yuning Yang

Sparse tensor best rank-1 approximation (BR1Approx), which is a sparsity generalization of the dense tensor BR1Approx, and is a higher-order extension of the sparse matrix BR1Appro…