A Fast Eigen Solution for Homogeneous Quadratic Minimization with at most Three Constraints
Numerical Analysis
2016-11-17 v1 Information Theory
math.IT
Abstract
We propose an eigenvalue based technique to solve the Homogeneous Quadratic Constrained Quadratic Programming problem (HQCQP) with at most 3 constraints which arise in many signal processing problems. Semi-Definite Relaxation (SDR) is the only known approach and is computationally intensive. We study the performance of the proposed fast eigen approach through simulations in the context of MIMO relays and show that the solution converges to the solution obtained using the SDR approach with significant reduction in complexity.
Cite
@article{arxiv.1308.0104,
title = {A Fast Eigen Solution for Homogeneous Quadratic Minimization with at most Three Constraints},
author = {Dinesh Dileep Gaurav and K. V. S. Hari},
journal= {arXiv preprint arXiv:1308.0104},
year = {2016}
}
Comments
15 pages, The same content without appendices is accepted and is to be published in IEEE Signal Processing Letters