2021
DOI: 10.48550/arxiv.2110.12121
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization

Abstract: In this paper, we propose a general procedure for establishing the landscape connections of a Riemannian optimization problem under the embedded and quotient geometries. By applying the general procedure to the fixed-rank positive semidefinite (PSD) and general matrix optimization, we establish an exact Riemannian gradient connection under two geometries at every point on the manifold and sandwich inequalities between the spectra of Riemannian Hessians at Riemannian first-order stationary points (FOSPs). These… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 37 publications
(32 reference statements)
0
2
0
Order By: Relevance
“…Proposition 3.1 is one of the results in a chapter of the thesis [12, §5.2.3]. In a more recent work [24,Remark 9], the same result is given as an example of the geometric connections of embedded and quotient geometries in Riemannian fixed-rank matrix optimization.…”
Section: Main Results About Rgd Onmentioning
confidence: 79%
See 1 more Smart Citation
“…Proposition 3.1 is one of the results in a chapter of the thesis [12, §5.2.3]. In a more recent work [24,Remark 9], the same result is given as an example of the geometric connections of embedded and quotient geometries in Riemannian fixed-rank matrix optimization.…”
Section: Main Results About Rgd Onmentioning
confidence: 79%
“…We prove the spectral lower bound of Hessf (M ⋆ ) as follows. First, the exponential map at Y := M ⋆ has the following expression (e.g., [3], [38, Proposition A1], [37, Appendix A]), (4.24) Exp 24), it follows that the quadratic function f (4.1) satisfies, for any…”
Section: Convergence Analysismentioning
confidence: 99%