A privacy-preserving method to optimize distributed resource allocation
From MaRDI portal
Abstract: We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly nonconvex, cost while satisfying the agents' constraints, for instance an energy operator in charge of the management of energy consumption flexibilities of many individual consumers. We provide a privacy-preserving algorithm that does compute the optimal allocation of resources, avoiding each agent to reveal her private information (constraints and individual solution profile) neither to the central operator nor to a third party. Our method relies on an aggregation procedure: we compute iteratively a global allocation of resources, and gradually ensure existence of a disaggregation, that is individual profiles satisfying agents' private constraints, by a protocol involving the generation of polyhedral cuts and secure multiparty computations (SMC). To obtain these cuts, we use an alternate projection method, which is implemented locally by each agent, preserving her privacy needs. We adress especially the case in which the local and global constraints define a transportation polytope. Then, we provide theoretical convergence estimates together with numerical results, showing that the algorithm can be effectively used to solve the allocation problem in high dimension, while addressing privacy issues.
Recommendations
- Privacy preserving distributed optimization using homomorphic encryption
- Jointly private convex programming
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Distributed Computing – IWDC 2005
Cites work
- A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- A theorem on flows in networks
- Algorithms for the Assignment and Transportation Problems
- An Algorithm for Restricted Least Squares Regression
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Bicriteria Transportation Problem
- Consensus-Based Data-Privacy Preserving Data Aggregation
- Dykstra's alternating projection algorithm for two sets
- Functional Operators (AM-21), Volume 1
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- New variants of bundle methods
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Optimal scaling of a gradient method for distributed resource allocation
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Partitioning procedures for solving mixed-variables programming problems
- Secure and Privacy-Preserving Consensus
- The method of projections for finding the common point of convex sets
- Transportation polytopes
Cited in
(11)- Decentralised scheduling with confidentiality protection
- Privacy preserving distributed optimization using homomorphic encryption
- Protecting privacy through distributed computation in multi-agent decision making
- On Efficient Distribution with Private Information
- Enabling Privacy-Preservation in Decentralized Optimization
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Distributed safe resource allocation using barrier functions
- Dynamics based privacy preservation in decentralized optimization
- Differentially private dual gradient tracking for distributed resource allocation
- Review of mathematical optimization in federated learning
- Mean field optimization problems: stability results and Lagrangian discretization
This page was built for publication: A privacy-preserving method to optimize distributed resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123999)
