Unconstrained formulation of standard quadratic optimization problems
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2010-12.
Date of creation: 2010
Date of revision:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Immanuel Bomze & Chen Ling & Liqun Qi & Xinzhen Zhang, 2012. "Standard bi-quadratic optimization problems and unconstrained polynomial reformulations," Journal of Global Optimization, Springer, vol. 52(4), pages 663-687, April.
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.