Decentralized and privacy-preserving low-rank matrix completion
From MaRDI portal
Publication:2516374
DOI10.1007/S40305-015-0080-4zbMath1331.49043OpenAlexW1971179133MaRDI QIDQ2516374
Publication date: 31 July 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-015-0080-4
Related Items (2)
An overview of structural systems theory ⋮ A Riemannian gossip approach to subspace learning on Grassmann manifold
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- Distributed average consensus with least-mean-square deviation
- Distributed event-triggered communication for dynamic average consensus in networked systems
- Discrete-time dynamic average consensus
- Generic properties and control of linear structured systems: A survey
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Fast linear iterations for distributed averaging
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Adaptation, Learning, and Optimization over Networks
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Consensus and Cooperation in Networked Multi-Agent Systems
- Fastest Mixing Markov Chain on a Graph
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Phase Retrieval via Matrix Completion
This page was built for publication: Decentralized and privacy-preserving low-rank matrix completion
