Computation over t-Product Based Tensor Stiefel Manifold: A Preliminary Study

被引:0
|
作者
Mao, Xian-Peng [1 ]
Wang, Ying [2 ]
Yang, Yu-Ning [2 ,3 ]
机构
[1] Guangxi Univ, Sch Phys Sci & Technol, Nanning 530004, Guangxi, Peoples R China
[2] Guangxi Univ, Coll Math & Informat Sci, Nanning 530004, Guangxi, Peoples R China
[3] Guangxi Univ, Ctr Appl Math Guangxi, Nanning 530004, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensor; t-Product; Stiefel manifold; Retraction; Vector transport; Manifold optimization; OPTIMIZATION; DECOMPOSITIONS; COMPLETION; ALGORITHMS; FRAMEWORK; GEOMETRY;
D O I
10.1007/s40305-023-00522-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Let * denote the t-product between two third-order tensors proposed by Kilmer and Martin (Linear Algebra Appl 435(3): 641-658, 2011). The purpose of this work is to study fundamental computation over the set St (n, p, l) := {X is an element of R-nxpxl vertical bar X-inverted perpendicular * X = I}, where X is a third-order tensor of size nxpxl (n >= p) and I is the identity tensor. It is first verified that St (n, p, l) endowed with the Euclidean metric forms a Riemannian manifold, which is termed as the (third-order) tensor Stiefel manifold in this work. We then derive the tangent space, Riemannian gradient, and Riemannian Hessian on St (n, p, l). In addition, formulas of various retractions based on t-QR, t-polar decomposition, t-Cayley transform, and t-exponential, as well as vector transports, are presented. It is expected that analogous to their matrix counterparts, the derived formulas may serve as building blocks for analyzing optimization problems over the tensor Stiefel manifold and designing Riemannian algorithms.
引用
收藏
页数:49
相关论文
共 50 条
  • [31] Tensor Conjugate Gradient Methods with Automatically Determination of Regularization Parameters for Ill-Posed Problems with t-Product
    Wang, Shi-Wei
    Huang, Guang-Xin
    Yin, Feng
    [J]. MATHEMATICS, 2024, 12 (01)
  • [32] Fast and Efficient MMD-Based Fair PCA via Optimization over Stiefel Manifold
    Lee, Junghyun
    Kim, Gwangsu
    Olfat, Mahbod
    Hasegawa-Johnson, Mark
    Yoo, Chang D.
    [J]. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 7363 - 7371
  • [33] Tensor Arnoldi-Tikhonov and GMRES-Type Methods for Ill-Posed Problems with a t-Product Structure
    Reichel, Lothar
    Ugwu, Ugochukwu O.
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2022, 90 (01)
  • [34] The tensor Golub-Kahan-Tikhonov method applied to the solution of ill-posed problems with a t-product structure
    Reichel, Lothar
    Ugwu, Ugochukwu O.
    [J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2022, 29 (01)
  • [35] The MPWG inverse of third-order F-square tensors based on the T-product
    He, Mengyu
    Liu, Xiaoji
    Jin, Hongwei
    [J]. FILOMAT, 2024, 38 (03) : 939 - 956
  • [36] Conjugate gradient-type method for the tensor linear system via the T-product and its application in the calculation of Moore-Penrose inverse
    Huang, Baohua
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2024, 472
  • [37] A benchmark study based on the parallel computation of the vector outer-product A=uv(T) operation
    DaCunha, RD
    [J]. CONCURRENCY-PRACTICE AND EXPERIENCE, 1997, 9 (08): : 803 - 819
  • [38] A New Lightweight Key Exchange Protocol Based on T-tensor Product
    Peng, Haipeng
    He, Mengwei
    Li, Lixiang
    Yang, Yixian
    [J]. PROCEEDINGS OF 2020 IEEE 4TH INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2020), 2020, : 736 - 741
  • [39] Convergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-product
    Soto-Quiros, Pablo
    [J]. RESULTS IN APPLIED MATHEMATICS, 2023, 18
  • [40] Perturbation Analysis for t-Product-Based Tensor Inverse, Moore-Penrose Inverse and Tensor System
    Zhengbang Cao
    Pengpeng Xie
    [J]. Communications on Applied Mathematics and Computation, 2022, 4 : 1441 - 1456