Matrix completion under interval uncertainty
From MaRDI portal
Publication:1752160
DOI10.1016/j.ejor.2016.07.014zbMath1394.90462arXiv1408.2467OpenAlexW2591758317MaRDI QIDQ1752160
Jakub Mareček, Martin Takáč, Peter Richtárik
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2467
large-scale optimizationmatrix completionrobust optimizationcollaborative filteringcoordinate descent
Numerical mathematical programming methods (65K05) Convex programming (90C25) Matrix completion problems (15A83)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Parallel coordinate descent methods for big data optimization
- Robust least square semidefinite programming with applications
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Recent advances in robust optimization: an overview
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Operations research and data mining
- `Horses for courses' in demand forecasting
- Exact matrix completion via convex optimization
- Distributed Coordinate Descent Method for Learning with Big Data
- Normalized Iterative Hard Thresholding for Matrix Completion
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Separable approximations and decomposition methods for the augmented Lagrangian
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions
- The complexity of matrix completion
- Sparse Approximate Solutions to Linear Systems
- Correlation matrix nearness and completion under observation uncertainty
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
- Low-rank matrix completion using alternating minimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Generalized low rank approximations of matrices
