Pages that link to "Item:Q5242864"

The following pages link to The non-convex geometry of low-rank matrix optimization (Q5242864):

Displaying 12 items.

• The global optimization geometry of shallow linear neural networks (Q1988338) (← links)
• Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization (Q2052408) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
• Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
• Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation (Q5081098) (← links)
• Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA (Q5214234) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization (Q5231691) (← links)
• Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support (Q6101122) (← links)
• Low-Rank Univariate Sum of Squares Has No Spurious Local Minima (Q6176423) (← links)