Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

Randomized average block coordinate descent method with heavy-ball momentum for tensor least squares problem under the t-product

Abstract

A tensor randomized average block coordinate descent method with heavy-ball momentum is proposed for the tensor least squares problem with respect to the t-product. Theoretical analysis for tensor block coordinate descent method is established and average techniques are applied to avoid the computation of tensor Moore--Penrose inverse. To further accelerate convergence, a heavy-ball momentum scheme is incorporated into the block coordinate descent method, where the step size and momentum parameters are adaptively determined by a two-dimensional minimal residual projection. Theoretical analyses give the convergence of the new method and provide an improved bound on the linear convergence rate. Numerical experiments further verify the efficiency of the proposed method in terms of the number of iterations and the better video recovery performance.

Related

  1. On randomized batch-sampling coordinate descent methods for solving linear least-squares problems
    Dong-Yue Xie, Xi Yang
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
  2. Globally Convergent Block Coordinate Descent Algorithms for Semi-Nonnegative Independent Component Analysis
    Zhenyu Cai, Wentao Ding, Jianze Li +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. How to Train Your Intercept: A Comparison of Intercept Update Strategies in Coordinate Descent
    Johan Larsson, Frederik Fabricius-Bjerre
    arXivPreprintCC BY 4.0Full textOptimisation & controlStatisticsarXiv
  4. Sharp Convergence and Sample Complexity of Policy Mirror Descent for Average-Reward MDPs
    Enes Arda, Atilla Eryilmaz
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Boundary Geometry and Global Rates of Cyclic Coordinate Descent for SVM Duals
    Egor Gladin, Eva Ibodova
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{ji2026randomized,
  title = {{Randomized average block coordinate descent method with heavy-ball momentum for tensor least squares problem under the t-product}},
  author = {Li-Lin Ji and Ni-Hong Ke and Jun-Feng Yin},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.14516},
  eprint = {2609.14516},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.14516},
}
RIS
TY  - UNPB
TI  - Randomized average block coordinate descent method with heavy-ball momentum for tensor least squares problem under the t-product
AU  - Li-Lin Ji
AU  - Ni-Hong Ke
AU  - Jun-Feng Yin
PY  - 2026
DA  - 2026/09/13
PB  - arXiv
DO  - 10.48550/arxiv.2609.14516
UR  - https://arxiv.org/abs/2609.14516
AB  - A tensor randomized average block coordinate descent method with heavy-ball momentum is proposed for the tensor least squares problem with respect to the t-product. Theoretical analysis for tensor block coordinate descent method is established and average techniques are applied to avoid the computation of tensor Moore--Penrose inverse. To further accelerate convergence, a heavy-ball momentum scheme is incorporated into the block coordinate descent method, where the step size and momentum parameters are adaptively determined by a two-dimensional minimal residual projection. Theoretical analyses give the convergence of the new method and provide an improved bound on the linear convergence rate. Numerical experiments further verify the efficiency of the proposed method in terms of the number of iterations and the better video recovery performance.
ER  -