scientific article; zbMATH DE number 7359342
DOI10.4230/LIPIcs.ITCS.2018.5zbMath1462.15031arXiv1704.08683MaRDI QIDQ4993268
David P. Woodruff, Hongyang Zhang, Yingyu Liang, Maria-Florina Balcan
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1704.08683
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matrix completion problems (15A83)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- The convex geometry of linear inverse problems
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Exact matrix completion via convex optimization
- Estimation in High Dimensions: A Geometric Perspective
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Guaranteed Matrix Completion via Non-Convex Factorization
- Completing Low-Rank Matrices With Corrupted Samples From Few Coefficients in General Basis
- Incoherence-Optimal Matrix Completion
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Robust principal component analysis?
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
- Introduction to the Theory of Nonlinear Optimization
- Relations between average case complexity and approximation complexity
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- On the combinatorial and algebraic complexity of quantifier elimination
- Finding approximate local minima faster than gradient descent
- Katyusha: the first direct acceleration of stochastic gradient methods
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Weighted low rank approximations with provable guarantees
- A Simpler Approach to Matrix Completion
- Low-rank matrix completion using alternating minimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
This page was built for publication:
