A divide-and-conquer algorithm for binary matrix completion

DOI10.1016/j.laa.2020.04.017OpenAlexW2959979976MaRDI QIDQ2187387

Yanyan Li

Publication date: 2 June 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.04251

zbMATH Keywords

linear programmingrecommender systemsbinary matrix completion

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Uses Software

• ChEMBL
• MovieLens

Cites Work

• Unnamed Item
• An alternating direction algorithm for matrix completion with nonnegative factors
• Nuclear norm minimization for the planted clique and biclique problems
• Low rank matrix completion by alternating steepest descent methods
• A bound for the number of different basic solutions generated by the simplex method
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Exact matrix completion via convex optimization
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• New Finite Pivoting Rules for the Simplex Method
• A Clustering Approach to Constrained Binary Matrix Factorization
• Learning the parts of objects by non-negative matrix factorization
• Discovery Science
• Low-rank matrix completion using alternating minimization

This page was built for publication: A divide-and-conquer algorithm for binary matrix completion