Research Article

Task Allocation Optimization Scheme Based on Queuing Theory for Mobile Edge Computing in 5G Heterogeneous Networks

Algorithm 1

Newton algorithm
(1)Initial feasible point , define as a sufficiently small positive real number, .
(2)Calculate and .
(3)If,
it should stop iterating;
else
 determine the search direction
(4)Calculate next iteration points:
(5) and turn to step 2.
where is the gradient vector of the objective function, is the inverse of the Hessian matrix, and the Newton iteration direction is . Each iteration of the Newton algorithm needs to solve the inverse of the Hessian matrix of the objective function, so that the calculation is complicated.