Low-rank retractions: a survey and new results

被引:41
|
作者
Absil, P. -A. [1 ]
Oseledets, I. V. [2 ]
机构
[1] Catholic Univ Louvain, Dept Engn Math, ICTEAM Inst, B-1348 Louvain La Neuve, Belgium
[2] Skolkovo Inst Sci & Technol, Moscow 143025, Russia
基金
俄罗斯科学基金会;
关键词
Low-rank manifold; Fixed-rank manifold; Low-rank optimization; Retraction; Geodesic; Quasi-geodesic; Projective retraction; Orthographic retraction; Lie-Trotter splitting; GRADIENT PROJECTION METHOD; RIEMANNIAN-MANIFOLDS; OPTIMIZATION; COMPLETION;
D O I
10.1007/s10589-014-9714-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Retractions are a prevalent tool in Riemannian optimization that provides a way to smoothly select a curve on a manifold with given initial position and velocity. We review and propose several retractions on the manifold of rank- matrices. With the exception of the exponential retraction (for the embedded geometry), which is clearly the least efficient choice, the retractions considered do not differ much in terms of run time and flop count. However, considerable differences are observed according to properties such as domain of definition, boundedness, first/second-order property, and symmetry.
引用
收藏
页码:5 / 29
页数:25
相关论文
共 50 条
  • [1] Low-rank retractions: a survey and new results
    P.-A. Absil
    I. V. Oseledets
    Computational Optimization and Applications, 2015, 62 : 5 - 29
  • [2] From low-rank retractions to dynamical low-rank approximation and back
    Seguin, Axel
    Ceruti, Gianluca
    Kressner, Daniel
    BIT NUMERICAL MATHEMATICS, 2024, 64 (03)
  • [3] Low-Rank Matrix Completion: A Contemporary Survey
    Luong Trung Nguyen
    Kim, Junhan
    Shim, Byonghyo
    IEEE ACCESS, 2019, 7 : 94215 - 94237
  • [4] DYNAMICALLY ORTHOGONAL RUNGE--KUTTA SCHEMES WITH PERTURBATIVE RETRACTIONS FOR THE DYNAMICAL LOW-RANK APPROXIMATION
    Charous, Aaron
    Lermusiaux, Pierre F. J.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2023, 45 (02) : A872 - A897
  • [5] Survey on Probabilistic Models of Low-Rank Matrix Factorizations
    Shi, Jiarong
    Zheng, Xiuyun
    Yang, Wei
    ENTROPY, 2017, 19 (08)
  • [6] RIEMANNIAN MULTIGRID LINE SEARCH FOR LOW-RANK PROBLEMS
    Sutti, Marco
    Vandereycken, Bart
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2021, 43 (03) : A1803 - A1831
  • [7] A Riemannian rank-adaptive method for low-rank optimization
    Zhou, Guifang
    Huang, Wen
    Gallivan, Kyle A.
    Van Dooren, Paul
    Absil, Pierre-Antoine
    NEUROCOMPUTING, 2016, 192 : 72 - 80
  • [8] Low-rank optimization on Tucker tensor varieties
    Gao, Bin
    Peng, Renfeng
    Yuan, Ya-xiang
    MATHEMATICAL PROGRAMMING, 2025,
  • [9] A Riemannian rank-adaptive method for low-rank matrix completion
    Gao, Bin
    Absil, P-A
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 81 (01) : 67 - 90
  • [10] A NEW PRECONDITIONER THAT EXPLOITS LOW-RANK APPROXIMATIONS TO FACTORIZATION ERROR
    Higham, Nicholas J.
    Mary, Theo
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2019, 41 (01) : A59 - A82