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 条
  • [31] LOW-RANK APPROXIMATION AND COMPLETION OF POSITIVE TENSORS
    Aswani, Anil
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2016, 37 (03) : 1337 - 1364
  • [32] Low-rank exploitation in semidefinite programming for control
    Falkeborn, Rikard
    Lofberg, Johan
    Hansson, Anders
    INTERNATIONAL JOURNAL OF CONTROL, 2011, 84 (12) : 1975 - 1982
  • [33] Learning Low-Rank Graph With Enhanced Supervision
    Liu, Hui
    Jia, Yuheng
    Hou, Junhui
    Zhang, Qingfu
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2022, 32 (04) : 2501 - 2506
  • [34] Recovery of low-rank matrices based on the rank null space properties
    Gao, Yi
    Han, Xuanli
    Ma, Mingde
    INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING, 2017, 15 (04)
  • [35] Fixed-rank matrix factorizations and Riemannian low-rank optimization
    Mishra, Bamdev
    Meyer, Gilles
    Bonnabel, Silvere
    Sepulchre, Rodolphe
    COMPUTATIONAL STATISTICS, 2014, 29 (3-4) : 591 - 621
  • [36] MATRIX COMPLETION FOR MATRICES WITH LOW-RANK DISPLACEMENT
    Lazzaro, Damiana
    Morigi, Serena
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2020, 53 : 481 - 499
  • [37] A Riemannian rank-adaptive method for low-rank matrix completion
    Bin Gao
    P.-A. Absil
    Computational Optimization and Applications, 2022, 81 : 67 - 90
  • [38] Fast Tensor Nuclear Norm for Structured Low-Rank Visual Inpainting
    Xu, Honghui
    Zheng, Jianwei
    Yao, Xiaomin
    Feng, Yuchao
    Chen, Shengyong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2022, 32 (02) : 538 - 552
  • [39] A dual framework for low-rank tensor completion
    Nimishakavi, Madhav
    Jawanpuria, Pratik
    Mishra, Bamdev
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [40] A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Learning
    Wang, Yaqing
    Yao, Quanming
    Kwok, James
    PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 1798 - 1808