Tightening a copositive relaxation for standard quadratic optimization problems
Yong Xia (),
Ruey-Lin Sheu (),
Xiaoling Sun () and
Duan Li ()
Computational Optimization and Applications, 2013, vol. 55, issue 2, 379-398
Abstract:
We focus in this paper the problem of improving the semidefinite programming (SDP) relaxations for the standard quadratic optimization problem (standard QP in short) that concerns with minimizing a quadratic form over a simplex. We first analyze the duality gap between the standard QP and one of its SDP relaxations known as “strengthened Shor’s relaxation”. To estimate the duality gap, we utilize the duality information of the SDP relaxation to construct a graph G ∗ . The estimation can be then reduced to a two-phase problem of enumerating first all the minimal vertex covers of G ∗ and solving next a family of second-order cone programming problems. When there is a nonzero duality gap, this duality gap estimation can lead to a strictly tighter lower bound than the strengthened Shor’s SDP bound. With the duality gap estimation improving scheme, we develop further a heuristic algorithm for obtaining a good approximate solution for standard QP. Copyright Springer Science+Business Media New York 2013
Keywords: Standard quadratic optimization problem; Shor’s relaxation; Semidefinite programming; Duality gap; Minimal vertex cover; Second-order cone program (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9522-7 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:55:y:2013:i:2:p:379-398
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-012-9522-7
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().