Abstract
In this paper, we consider the following indefinite complex quadratic maximization problem: max- imize z H Qz, subject to zk ∈ C and z m k =1 ,k =1 ,...,n ,w hereQ is a Hermitian matrix with trQ =0 ,z ∈ C n is the decision vector, and m 3. An Ω(1/ logn) approximation algorithm is presented for such problem. Furthermore, we consider the above problem where the objective matrix Q is in bilinear form, in which case a 0.7118 � cos π m � 2 approximation algorithm can be constructed. In the context of quadratic optimization, various extensions and connections of the model are discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.