Contents Intro.

In multicellular networks that implement simultaneous wireless information and power transfer, many radio resource allocation problems are nonconvex by nature. It is challenging to find optimal solutions that are computationally efficient for large-scale network deployments. In this talk, several examples of such inherently difficult problems are presented. The sequential convex optimization framework is then introduced. Under this framework, the nonconvex problems are transformed into a sequence of convex problems, each of which is solved very efficiently by the interior-point method. This state-of-the-art technique allows locally optimal solutions to be found, which satisfy the Karush-Kuhn-Tucker conditions of the original nonconvex problems. It can deal with a wide range of key performance objectives, including sum-rate maximization, max-min throughput, sum-power minimization and so on.

Details

Publication year

2016

Form

37 p.

Series title

講義・講演レジュメ ; 平成28年度

情報科学研究科・ゼミナール講演 ; 平成28年度

Note

奈良先端科学技術大学院大学情報科学研究科

講演日: 平成28年10月5日

講演場所: 情報科学研究科大講義室L1

Country of publication

Japan

Title language

English (eng)

Language of texts

English (eng)

Author information

Ngo, Trong Duy