Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication …