A new complexity metric for nonconvex rank-one generalized matrix completion
DOI10.1007/S10107-023-02008-5zbMATH Open1547.65048MaRDI QIDQ6608034FDOQ6608034
Authors: Haixiang Zhang, Baturalp Yalcin, Javad Lavaei, Somayeh Sojoudi 
Publication date: 19 September 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- On critical points of quadratic low-rank matrix optimization problems
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
- Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
- Guarantees of Riemannian optimization for low rank matrix completion
- Model-free nonconvex matrix completion: local minima analysis and applications in memory-efficient kernel PCA
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
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- 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)
