Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper studies the max-min fair multicast multigroup beamforming problem in a multi-cell environment, with perfect (instantaneous or statistical) Channel State Information (CSI).  propose a new general distributed algorithmic framework based on INner Convex Approximations (INCA): the nonsmooth NP-hard problem is replaced by a sequence of smooth strongly convex subproblems, which can be solved in a distributed fashion across the cells, with limited communication overhead. Differently from renowned semidefinite-relaxation-based schemes, the INCA algorithm is proved to always converge to a d-stationary solution of the aforementioned class of problems. Numerical results show that it compares favorably with state-of-the-art algorithms.
['Peiran Song', 'Gesualdo Scutari', 'Francisco Facchinei', 'Lorenzo Lampariello']
I am writing a research paper on a idea D3M: Distributed multi-cell multigroup multicasting
[{"from": "human", "value": "I am writing a research paper on a idea D3M: Distributed multi-cell multigroup multicasting"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The paper studies the max-min fair multicast multigroup beamforming problem in a multi-cell environment, with perfect (instantaneous or statistical) Channel State Information (CSI).  propose a new general distributed algorithmic framework based on INner Convex Approximations (INCA): the nonsmooth NP-hard problem is replaced by a sequence of smooth strongly convex subproblems, which can be solved in a distributed fashion across the cells, with limited communication overhead. Differently from renowned semidefinite-relaxation-based schemes, the INCA algorithm is proved to always converge to a d-stationary solution of the aforementioned class of problems. Numerical results show that it compares favorably with state-of-the-art algorithms."}]