Hidden Convexity in QCQP with Toeplitz-Hermitian Quadratics


Quadratically Constrained Quadratic Programming (QCQP) includes a broad spectrum of applications in engineering. The overall QCQP problem is NP-Exhausting. This text considers QCQP with Toeplitz-Hermitian quadratics, and shows that it possesses hidden convexity: it can always be solved in polynomial-time via Semidefinite Relaxation followed by spectral factorization. Furthermore, if the matrices are circulant, then the QCQP can be equivalently reformulated as a linear program, that will be solved very efficiently. An application to parametric power spectrum sensing from binary measurements is included to illustrate the results.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :LAW: A Novel Mechanism for Addressing Hidden Terminal Problem in LTE-U and Wi-Fi Networks - 2018ABSTRACT:Recently, the use of LTE in unlicensed spectrum (LTE-U) has gained a lot of attention. One of the daunting
PROJECT TITLE : Wormhole: The Hidden Virus Propagation Power of a Search Engine in Social Networks - 2017 ABSTRACT: Today search engines are tightly let alone social networks, and present users with a double-edged sword: they're
PROJECT TITLE :Dynamic Detection of Transmission Line Outages Using Hidden Markov ModelsABSTRACT:We tend to study the matter of detecting transmission line outages in power grids. We have a tendency to model the time series of
PROJECT TITLE :Empirical analysis of Tor Hidden ServicesABSTRACT:Tor hidden services permit someone to host a website or other transmission control protocol (TCP) service whilst remaining anonymous to visitors. The assortment
PROJECT TITLE :Hidden Markov Models for the Prediction of Impending FaultsABSTRACT:Reliability and safety are 2 vital ideas in industrial applications. So, the development of monitoring tools, which are in a position to make sure

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry