Feasible methods for nonconvex nonsmooth problems with applications in green communications
Feasible methods for nonconvex nonsmooth problems with applications in green communications
复制标题
DOI：
10.1007/s10107-016-1072-9
复制
发表时间：
2016-10
影响因子：
2.7
通讯作者：
F. Facchinei;Lorenzo Lampariello;G. Scutari
中科院分区：
文献类型：
--
作者：
F. Facchinei;Lorenzo Lampariello;G. Scutari
我们提出了一个通用的可行的方法，非光滑，非凸约束优化问题。该算法是基于一系列强凸优化子问题的（不精确）解决方案，其次是一个步长的过程。该方案的主要特点是：（i）它保留了非凸约束的非凸问题的迭代的可行性，（ii）它可以处理非光滑问题，（iii）它自然会导致并行/分布式实现。我们说明了该方法的应用程序在绿色通信中的一个开放的问题，从而在MIMO多用户干扰网络的能量消耗最小化，受到非凸服务质量的约束。
We propose a general feasible method for nonsmooth, nonconvex constrained optimization problems. The algorithm is based on the (inexact) solution of a sequence of strongly convex optimization subproblems, followed by a step-size procedure. Key features of the scheme are: (i) it preserves feasibility of the iterates for nonconvex problems with nonconvex constraints, (ii) it can handle nonsmooth problems, and (iii) it naturally leads to parallel/distributed implementations. We illustrate the application of the method to an open problem in green communications whereby the energy consumption in MIMO multiuser interference networks is minimized, subject to nonconvex Quality-of-Service constraints.