IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v206y2025i1d10.1007_s10957-025-02682-9.html
   My bibliography  Save this article

Gauss–Southwell Type Descent Methods for Low-Rank Matrix Optimization

Author

Listed:
  • Guillaume Olikier

    (Université Côte d’Azur and Inria)

  • André Uschmajew

    (University of Augsburg)

  • Bart Vandereycken

    (University of Geneva)

Abstract

We consider gradient-related methods for low-rank matrix optimization with a smooth cost function. The methods operate on single factors of the low-rank factorization and share aspects of both alternating and Riemannian optimization. Two possible choices for the search directions based on Gauss–Southwell type selection rules are compared: one using the gradient of a factorized non-convex formulation, the other using the Riemannian gradient. While both methods provide gradient convergence guarantees that are similar to the unconstrained case, numerical experiments on a quadratic cost function indicate that the version based on the Riemannian gradient is significantly more robust with respect to small singular values and the condition number of the cost function. As a side result of our approach, we also obtain new convergence results for the alternating least squares method.

Suggested Citation

  • Guillaume Olikier & André Uschmajew & Bart Vandereycken, 2025. "Gauss–Southwell Type Descent Methods for Low-Rank Matrix Optimization," Journal of Optimization Theory and Applications, Springer, vol. 206(1), pages 1-32, July.
    • Handle: RePEc:spr:joptap:v:206:y:2025:i:1:d:10.1007_s10957-025-02682-9
    DOI: 10.1007/s10957-025-02682-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02682-9
    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/s10957-025-02682-9?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:joptap:v:206:y:2025:i:1:d:10.1007_s10957-025-02682-9. 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.