Abstract
In this paper we solve the open problem, finding the solutions for privacy-preserving horizontally partitioned linear programs with inequality constraints, proposed recently by Mangasarian (Optim Lett 2011, doi:10.1007/s11590-010-0268-9).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Du, W.: A study of several specific secure two-party computation problems. PhD thesis, Purdue University, Indiana (2001)
Chen, K., Liu, L.: Privacy preserving data classification with rotation perturbation. In: Proceedings of the fifth international conference of data mining (ICDM’05), pp. 589–592. IEEE (2005)
Li, J., Atallah, M.: Secure and private collaborative linear programming. In: Proceedings of international conference on collaborative computing, pp. 1–8 (2006)
Vaidya, J.: Privacy-preserving linear programming. In: Proceedings of the 2009 ACM symposium on Applied Computing, pp. 2002–2007. ACM, New York (2009)
Vaidya, J.: A secure revised simplex algorithm for privacy-preserving linear programming. In: International conference on advanced information networking and applications, pp. 347–354 (2009)
Bednarz, A., Bean, N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: Proceedings of the 8th ACM workshop on privacy in the electronic society, pp. 117–120 (2009)
Mangasarian O.L.: Privacy-preserving linear programming. Optim. Lett. 5, 165–172 (2011)
Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optim. Lett. (2011). doi:10.1007/s11590-010-0268-9
Feng X., Zhang Z.: The rank of a random matrix. Appl. Math. Comput. 185, 689–694 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, W., Li, H. & Deng, C. Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optim Lett 7, 137–144 (2013). https://doi.org/10.1007/s11590-011-0403-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0403-2