A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion
From MaRDI portal
Cites work
- 1-bit matrix completion
- A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
- An MM Algorithm for Split Feasibility Problems
- ARPACK Users' Guide
- Bayesian mean-parameterized nonnegative binary matrix factorization
- Complexity measures of sign matrices
- GNMR: a provable one-line algorithm for low rank matrix recovery
- scientific article; zbMATH DE number 756188 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Learning from binary multiway data: probabilistic tensor decomposition and its statistical optimality
- Learning Tensors From Partial Binary Measurements
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Manopt, a Matlab toolbox for optimization on manifolds
- Methods of conjugate gradients for solving linear systems
- MM optimization algorithms
- On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations
- Principal component analysis of binary data by iterated singular value decomposition
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Tensor Completion From One-Bit Observations
- The aspect Bernoulli model: multiple causes of presences and absences
This page was built for publication: A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892359)
