Efficient and verifiable outsourcing computation of largescale nonlinear programming

0Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Nonlinear programming (NLP) problems arise in various fields, such as transport, financial engineering, logistics, urban planning, supply chain management, and power system control. Solving large-scale NLPs are usually so computationally expensive for resource-constrained users within a feasible time. The cost-effective solution is computation outsourcing, but this raises security concerns such as the input and output privacy of the customers, and cheating behaviors of the cloud since NLP problems always carry sensitive information. In this paper, we develop a practical secure and verifiable schema for solving outsourcing large-scale (NLP) with the GRG method. Also, we apply approximate KKT conditions for verifying the optimality of the result returned by the GRG algorithm. We implement the proposed schema on the customer side laptop and using AWS compute domain elastic compute cloud (EC2) for the cloud side.

Cite

CITATION STYLE

APA

Mohammed, N. M., Al-Seadi, A. N., Lomte, S. S., Rokade, P. M., & Hamoud, A. A. (2020). Efficient and verifiable outsourcing computation of largescale nonlinear programming. Journal of Mathematics and Computer Science, 21(4), 335–343. https://doi.org/10.22436/jmcs.021.04.06

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free