IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v91y2025i3d10.1007_s10589-025-00687-8.html
   My bibliography  Save this article

Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints

Author

Listed:
  • Shixin Zheng

    (Purdue University)

  • Wen Huang

    (Xiamen University)

  • Bart Vandereycken

    (University of Geneva)

  • Xiangxiong Zhang

    (Purdue University)

Abstract

For smooth optimization problems with a Hermitian positive semidefinite fixed-rank constraint, we consider three existing approaches including the simple Burer–Monteiro method, and Riemannian optimization over quotient geometry and the embedded geometry. These three methods can be all represented via quotient geometry with three Riemannian metrics $$g^i(\cdot , \cdot )$$ g i ( · , · ) $$(i=1,2,3)$$ ( i = 1 , 2 , 3 ) . By taking the nonlinear conjugate gradient method (CG) as an example, we show that CG in the factor-based Burer–Monteiro approach is equivalent to Riemannian CG on the quotient geometry with the Bures–Wasserstein metric $$g^1$$ g 1 . Riemannian CG on the quotient geometry with the metric $$g^3$$ g 3 is equivalent to Riemannian CG on the embedded geometry. For comparing the three approaches, we analyze the condition number of the Riemannian Hessian near a minimizer under the three different metrics. Under certain assumptions, the condition number from the Bures–Wasserstein metric $$g^1$$ g 1 is significantly worse than the other two metrics. Numerical experiments show that the Burer–Monteiro CG method has obviously slower asymptotic convergence rate either when the minimizer has a large condition number or when it is rank deficient, which is consistent with the condition number analysis.

Suggested Citation

  • Shixin Zheng & Wen Huang & Bart Vandereycken & Xiangxiong Zhang, 2025. "Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints," Computational Optimization and Applications, Springer, vol. 91(3), pages 1135-1184, July.
  • Handle: RePEc:spr:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00687-8
    DOI: 10.1007/s10589-025-00687-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-025-00687-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/s10589-025-00687-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:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00687-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.