Unconstrained formulation of standard quadratic optimization problems
A standard quadratic optimization problem (StQP) consists of nding the largest or smallest value of a (possibly indenite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadratic programming with linear constraints. We propose unconstrained reformulations of StQPs, by using dierent approaches. We test our method on clique problems from the DIMACS challenge.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Phone: +390677274140|
Fax: +39 0677274129
Web page: http://www.dis.uniroma1.it
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2010-12. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi)
If references are entirely missing, you can add them using this form.