UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM

Thumbnail Image

Files

Graham_Naomi.pdf (471.88 KB)

Date

2020-12-18

Authors

Graham, Naomi

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the two problems in a unified way using a binary-constrained quadratic program, BCQP. We show how to obtain upper and lower bounds for the BCQP by formulating the semidefinite programming (SDP) relaxation and applying the Alternating Direction Method of Multipliers (ADMM) algorithm to solve it. By unifying the two problems under the umbrella of the BCQP, we better understand why the method is so successful for these two problems and obtain a blueprint for applying ADMM to similar combinatorial optimization problems.

Description

Keywords

Semidefinite Programming, ADMM, Convex Optimization, Quadratic Programming, Quadratic Assignment Problem

LC Keywords

Citation

URI

http://hdl.handle.net/10012/16572

Collections

Theses
Combinatorics and Optimization