IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v349y2025i3d10.1007_s10479-025-06614-8.html
   My bibliography  Save this article

An extrapolation trust-region alternating least-squares algorithm for triple decomposition of third-order tensors

Author

Listed:
  • Xuejuan Zhang

    (University of Science and Technology Beijing)

  • Jinling Zhao

    (University of Science and Technology Beijing)

Abstract

Triple decomposition, which is a novel decomposition for the third order tensors, decomposes a third order tensor into a product of three third order low rank tensors. Alternating least-squares (ALS) is one of the most commonly used algorithms for tensor decomposition. In this paper, we combined the trust region method with the ALS algorithm to establish an extrapolation trust-region alternating least-squares algorithm for triple decomposition (TD-ETRALS). Different from the fixed regularization parameters in the modified alternating least-squares method (EMALS), TD-ETRALS adjusts the trust-region parameters in each iteration to achieve the preset accuracy of triple decomposition faster and more accurately. Theoretically, we prove that the sequence generated by TD-ETRALS converges to a critical point. Numerical experiments show that TD-ETRALS preforms better than EMALS in triple decomposition for the tensors generated by a uniform distribution in the relatively narrow interval and the tensors with Gaussian noise. In the example of image processing, TD-ETRALS also shows some advantages in low rank decomposition.

Suggested Citation

  • Xuejuan Zhang & Jinling Zhao, 2025. "An extrapolation trust-region alternating least-squares algorithm for triple decomposition of third-order tensors," Annals of Operations Research, Springer, vol. 349(3), pages 1933-1955, June.
    • Handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06614-8
    DOI: 10.1007/s10479-025-06614-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06614-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06614-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06614-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.