In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirements, and propose an efficient two-stage algorithm for solving this NP-hard problem.
Networking and Internet Architecture Information Theory Signal Processing Information Theory Optimization and Control
While there have been many numerical algorithms for solving smooth convex-concave minimax problems, numerical algorithms for nonsmooth convex-concave minimax problems are very rare.
Optimization and Control 90C30
In this paper, we propose a variable metric mini-batch proximal stochastic recursive gradient algorithm VM-mSRGBB, which updates the metric using a new diagonal BB stepsize.
One of the major issues in stochastic gradient descent (SGD) methods is how to choose an appropriate step size while running the algorithm.