دورية أكاديمية

Approximation algorithms for indefinite complex quadratic maximization problems

التفاصيل البيبلوغرافية
العنوان: Approximation algorithms for indefinite complex quadratic maximization problems
المؤلفون: Huang Yongwei, Zhang Shuzhong
المساهمون: The Pennsylvania State University CiteSeerX Archives
المصدر: http://www.ece.ust.hk/~eeyw/scicn09.pdfTest.
سنة النشر: 2008
المجموعة: CiteSeerX
مصطلحات موضوعية: randomized algorithms, approximation ratio, semidefinite program
الوصف: In this paper, we consider the following indefinite complex quadratic maximization problem: max-imize zHQz, subject to zk ∈ C and zmk = 1, k = 1,., n, where Q is a Hermitian matrix with trQ = 0, z ∈ Cn 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
نوع الوثيقة: text
وصف الملف: application/pdf
اللغة: English
العلاقة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.547.4078Test; http://www.ece.ust.hk/~eeyw/scicn09.pdfTest
الإتاحة: http://www.ece.ust.hk/~eeyw/scicn09.pdfTest
حقوق: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
رقم الانضمام: edsbas.C0167B8B
قاعدة البيانات: BASE