Reference : An Iterative Approach to Nonconvex QCQP with Applications in Signal Processing

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Electrical & electronics engineering
	To cite this reference:	http://hdl.handle.net/10993/29784

Title :	An Iterative Approach to Nonconvex QCQP with Applications in Signal Processing
Language :	English
Author, co-author :	Gharanjik, Ahmad [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Shankar, Bhavani [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Soltanalian, Mojtaba [University of Illinois at Chicago (UIC) > Department of Electrical and Computer Engineering > Assistant Professor in Information Systems,]
	Ottersten, Björn [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	10-Jul-2016
Main document title :	2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)
Publisher :	IEEE
Pages :	1-5
Peer reviewed :	Yes
On invitation :	No
Audience :	International
ISBN :	978-1-5090-2103-1
Event name :	2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)
Event date :	10-7-2016 to 12-7-2016
Event organizer :	IEEE
Event place (city) :	Rio de Janeiro
Event country :	Brazil
Keywords :	[en] QCQP ; non-convex ; signal processing
Abstract :	[en] This paper introduces a new iterative approach to solve or to approximate the solutions of the nonconvex quadratically constrained quadratic programs (QCQP). First, this constrained problem is transformed to an unconstrained problem using a specialized penalty-based method. A tight upper-bound for the alternative unconstrained objective is introduced. Then an efficient minimization approach to the alternative unconstrained objective is proposed and further studied. The proposed approach involves power iterations and minimization of a convex scalar function in each iteration, which are computationally fast. The important design problem of multigroup multicast beamforming is formulated as a nonconvex QCQP and solved using the proposed method.
Research centres :	SnT-SigCom
Permalink :	http://hdl.handle.net/10993/29784
DOI :	10.1109/SAM.2016.7569622
Other URL :	http://ieeexplore.ieee.org/document/7569622/

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access QCQP_SAM2016.pdf Author postprint 121.45 kB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map