| Full text | |
| Author(s): |
de Carli Silva, Marcel K.
;
Tuncel, Levent
Total Authors: 2
|
| Document type: | Journal article |
| Source: | MATHEMATICAL PROGRAMMING; v. 162, n. 1-2, p. 283-323, MAR 2017. |
| Web of Science Citations: | 0 |
| Abstract | |
Lovasz theta function and the related theta body of graphs have been in the center of the intersection of four research areas: combinatorial optimization, graph theory, information theory, and semidefinite optimization. In this paper, utilizing a modern convex optimization viewpoint, we provide a set of minimal conditions (axioms) under which certain key, desired properties are generalized, including the main equivalent characterizations of the theta function, the theta body of graphs, and the corresponding antiblocking duality relations. Our framework describes several semidefinite and polyhedral relaxations of the stable set polytope of a graph as generalized theta bodies. As a by-product of our approach, we introduce the notion of ``Schur Lifting{''} of cones which is dual to PSD Lifting (more commonly used in SDP relaxations of combinatorial optimization problems) in our axiomatic generalization. We also generalize the notion of complements of graphs to diagonally scaling-invariant polyhedral cones. Finally, we provide a weighted generalization of the copositive formulation of the fractional chromatic number by Dukanovic and Rendl from 2010. (AU) | |
| FAPESP's process: | 13/20740-9 - Applications of Semidefinite Programming in Combinatorial Optimization |
| Grantee: | Marcel Kenji de Carli Silva |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |