Skip to main content

Advertisement

SpringerLink
Log in

Privacy-preserving horizontally partitioned linear programs with inequality constraints

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Du, W.: A study of several specific secure two-party computation problems. PhD thesis, Purdue University, Indiana (2001)

  2. 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)

  3. Li, J., Atallah, M.: Secure and private collaborative linear programming. In: Proceedings of international conference on collaborative computing, pp. 1–8 (2006)

  4. Vaidya, J.: Privacy-preserving linear programming. In: Proceedings of the 2009 ACM symposium on Applied Computing, pp. 2002–2007. ACM, New York (2009)

  5. 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)

  6. 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)

  7. Mangasarian O.L.: Privacy-preserving linear programming. Optim. Lett. 5, 165–172 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optim. Lett. (2011). doi:10.1007/s11590-010-0268-9

  9. Feng X., Zhang Z.: The rank of a random matrix. Appl. Math. Comput. 185, 689–694 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Hangzhou Dianzi University, Hangzhou, 310018, People’s Republic of China

    Wei Li & Chongyang Deng

  2. Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, 310027, People’s Republic of China

    Haohao Li

Authors
  1. Wei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haohao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chongyang Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Li.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0403-2

Keywords

Search

Navigation