scientific article; zbMATH DE number 7306912
From MaRDI portal
Publication:5149024
Michael Lingzhi Li, Dimitris J. Bertsimas
Publication date: 5 February 2021
Full work available at URL: https://arxiv.org/abs/1910.09092
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A universal rank approximation method for matrix completion ⋮ Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- User-friendly tail bounds for sums of random matrices
- Characterization of the equivalence of robustification and regularization in linear and matrix regression
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Exact matrix completion via convex optimization
- Normalized Iterative Hard Thresholding for Matrix Completion
- Guaranteed Matrix Completion via Non-Convex Factorization
- Linear Matrix Inequalities in System and Control Theory
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
