A Privacy-Preserving Method to Optimize Distributed Resource Allocation

DOI10.1137/19M127879XzbMath1448.91130arXiv1908.03080MaRDI QIDQ5123999

Stéphane Gaubert, Paulin Jacquot, Pascal Benchimol, Nadia Oudjane, Olivier Beaude

Publication date: 17 September 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

aggregationresource allocationprivacyalternate projections

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Optimal scaling of a gradient method for distributed resource allocation
• Partitioning procedures for solving mixed-variables programming problems
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• New variants of bundle methods
• Transportation polytopes
• Algorithms for the Assignment and Transportation Problems
• An Algorithm for Restricted Least Squares Regression
• Bicriteria Transportation Problem
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings
• Secure and Privacy-Preserving Consensus
• Consensus-Based Data-Privacy Preserving Data Aggregation
• The method of projections for finding the common point of convex sets
• A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs
• Functional Operators (AM-21), Volume 1

This page was built for publication: A Privacy-Preserving Method to Optimize Distributed Resource Allocation