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. 2110.10279
  4. Cited By
Factorization Approach for Low-complexity Matrix Completion Problems:
  Exponential Number of Spurious Solutions and Failure of Gradient Methods

Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods

19 October 2021
Baturalp Yalcin
Haixiang Zhang
Javad Lavaei
Somayeh Sojoudi
ArXivPDFHTML

Papers citing "Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods"

2 / 2 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
17
6
0
29 Sep 2022
Accelerating nuclear-norm regularized low-rank matrix optimization
  through Burer-Monteiro decomposition
Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
Ching-pei Lee
Ling Liang
Tianyun Tang
Kim-Chuan Toh
19
11
0
29 Apr 2022
1