The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems

被引:1
|
作者
Liao, Yimou [1 ]
Li, Wen [1 ]
Yang, Dan
机构
[1] South China Normal Univ, Sch Math Sci, Guangzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensor systems; t-product; Momentum; Adaptive algorithm; Convergence analysis; Image processing; PRINCIPAL COMPONENT ANALYSIS; FACTORIZATION;
D O I
10.1016/j.apnum.2024.04.016
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Solving tensor systems is a common task in scientific computing and artificial intelligence. In this paper, we propose a tensor randomized average Kaczmarz method with adaptive parameters that exponentially converges to the unique least Frobenius norm solution of a given consistent tensor system under the t-product structure. In order to accelerate convergence, a tensor average Kaczmarz method based on stochastic heavy ball momentum technique (tAKSHBM) is proposed. The tAKSHBM method utilizes iterative information to update parameters instead of relying on prior information, addressing the problem in the adaptive learning of parameters. Additionally, the tAKSHBM method based on Fourier transform is proposed, which can be effectively implemented in a distributed environment. It is proven that the iteration sequences generated by all the proposed methods are convergent for given consistent tensor systems. Finally, we conduct experiments on both synthetic data and practical applications to support our theoretical results and demonstrate the effectiveness of the proposed algorithms.
引用
收藏
页码:100 / 119
页数:20
相关论文
共 50 条
  • [41] A sampling greedy average regularized Kaczmarz method for tensor recovery
    Zhang, Xiaoqing
    Guo, Xiaofeng
    Pan, Jianyu
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2024, 31 (05)
  • [42] Solving stochastic systems with low-rank tensor compression
    Matthies, Hermann G.
    Zander, Elmar
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (10) : 3819 - 3838
  • [43] Solving Linear Tensor Equations
    Iosifidis, Damianos
    UNIVERSE, 2021, 7 (10)
  • [44] A modified CG algorithm for solving generalized coupled Sylvester tensor equations
    Lv, Changqing
    Ma, Changfeng
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 365
  • [45] An efficient variant of the greedy block Kaczmarz algorithm for solving large linear systems
    Zhang, Ke
    Yin, Hong-Yan
    Jiang, Xiang-Long
    AIMS MATHEMATICS, 2024, 9 (01): : 2473 - 2499
  • [46] Paige's Algorithm for solving a class of tensor least squares problem
    Duan, Xue-Feng
    Zhang, Yong-Shen
    Wang, Qing-Wen
    Li, Chun-Mei
    BIT NUMERICAL MATHEMATICS, 2023, 63 (04)
  • [47] Paige’s Algorithm for solving a class of tensor least squares problem
    Xue-Feng Duan
    Yong-Shen Zhang
    Qing-Wen Wang
    Chun-Mei Li
    BIT Numerical Mathematics, 2023, 63
  • [48] A greedy block Kaczmarz algorithm for solving large-scale linear systems
    Niu, Yu-Qi
    Zheng, Bing
    APPLIED MATHEMATICS LETTERS, 2020, 104
  • [49] On the block Kaczmarz-Tanabe methods with relaxation parameters for solving linear systems
    Kang, Chuan-gang
    NUMERICAL ALGORITHMS, 2024,
  • [50] A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
    Heyouni, Mohammed
    Saberi-Movahed, Farid
    Tajaddini, Azita
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2020, 377