Privacy-preserving linear programming
From MaRDI portal
Recommendations
- Privacy-preserving horizontally partitioned linear programs
- Privacy-preserving vertically partitioned linear program with nonnegativity constraints
- Privately solving linear programs
- An inference-proof approach to privacy-preserving horizontally partitioned linear programs
- Privacy-preserving horizontally partitioned linear programs with inequality constraints
Cited in
(15)- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Consensus-based Dantzig-Wolfe decomposition
- scientific article; zbMATH DE number 2222198 (Why is no real title available?)
- Privacy-preserving nonlinear cloud-based model predictive control via affine masking
- Masking primal and dual models for data privacy in network revenue management
- Privacy-preserving linear and nonlinear approximation via linear programming
- Privacy-preserving vertically partitioned linear program with nonnegativity constraints
- Privacy-preserving horizontally partitioned linear programs
- Privacy-preserving scheduling model for minimizing the makespan on unrelated parallel machines
- Privacy-preserving horizontally partitioned linear programs with inequality constraints
- On reconstructability of quadratic utility functions from the iterations in gradient methods
- Privately solving linear programs
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- scientific article; zbMATH DE number 6402149 (Why is no real title available?)
- An inference-proof approach to privacy-preserving horizontally partitioned linear programs
This page was built for publication: Privacy-preserving linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628663)