Title:Efficient Semidefinite Programming (SDP) Relaxations for Quadratic Integer Programming (QIP) with Applications to Selection of Rotamers in Protein Conformations
| Speaker: | Henry Wolkowicz |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract: In this talk we study SDP relaxations of the (NP-hard) QIP problem: a quadratic objective with linear and integer constraints. We discuss how adding redundant constraints helps strengthen the relaxation. We show that the Slater constraint qualification (strict feasibility) fails for the SDP relaxation. We then show the advantages of using facial reduction, a minimal representation, to regularize the SDP. In fact, after applying facial reduction, we have a smaller equivalent problem that is more stable both in theory and in practice. Thus we have the seemingly contradictory strategy: adding redundant constraints and a maximal representation before the relaxation while removing redundancy and obtaining a minimal representation after the relaxation. We illustrate the strategy with an application to the side chain positioning problem in protein conformations.
Work with: Forbes Burkowski (University of Waterloo); Yuen-Lam Che- ung Voronin (University of Colorado, Boulder)