An Efficient Algorithm for Resource Allocation in Mobile Edge Computing Based on Convex Optimization and Karush–Kuhn–Tucker Method

Algorithm 1

Joint resource allocation and service caching.

	Initialize: Caching strategy of edge services , terminal transmit power , task input data size input , calculation required for each bit of input data quantity , the maximum number of iterations , and the algorithm termination condition
(1)	Convert the original issue into a continuous nonlinear issue to produce the new issue P2 based on the established service caching scheme.
(2)	Transform the nonlinear problem into convex optimization problem P3 by relaxing P2 with RLT
(3)	Use the interior point method to solve P3, and obtain the resource allocation scheme under the condition of known cache decision
(4)	Substitute the solution obtained in step 3 into P4 and obtain the corresponding unloading decision through relaxation method and convex optimization method
(5)	Obtain the difference between the objective function in step 3 and step 4, if the difference is less than or the number of iterations reaches the maximum value , stop the calculation. Otherwise, perform loop iterations on steps 3 and 4.