A new complexity metric for nonconvex rank-one generalized matrix completion

Numerical mathematical programming methods (65K05) Matrix completion problems (15A83) Nonconvex programming, global optimization (90C26) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Phase Retrieval via Wirtinger Flow: Theory and Algorithms
Robust principal component analysis?
Exact matrix completion via convex optimization
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Low-rank matrix completion using alternating minimization
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
Linear programming, complexity theory and elementary functional analysis
Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
Guaranteed Matrix Completion via Non-Convex Factorization
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Turan's Graph Theorem
Nonconvex Robust Low-Rank Matrix Recovery
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Guarantees of Riemannian optimization for low rank matrix recovery
A geometric analysis of phase retrieval
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Global Optimality in Low-Rank Matrix Optimization
Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,_∞ Regularization
Scalable Semidefinite Programming
Guarantees of Riemannian optimization for low rank matrix completion
Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery
Title not available (Why is that?)
Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA
Title not available (Why is that?)

This page was built for publication: A new complexity metric for nonconvex rank-one generalized matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608034)