ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2108.01772
  4. Cited By
Nonconvex Factorization and Manifold Formulations are Almost Equivalent
  in Low-rank Matrix Optimization

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization

3 August 2021
Yuetian Luo
Xudong Li
Anru R. Zhang
ArXivPDFHTML

Papers citing "Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization"

3 / 3 papers shown
Title
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape
  Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective
Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective
Yuetian Luo
Nicolas García Trillos
9
6
0
29 Sep 2022
On Geometric Connections of Embedded and Quotient Geometries in
  Riemannian Fixed-rank Matrix Optimization
On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization
Yuetian Luo
Xudong Li
Xinmiao Zhang
19
5
0
23 Oct 2021
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis
  Coefficients
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients
Weimin Miao
S. Pan
Defeng Sun
40
44
0
13 Oct 2012
1