Browsing Combinatorics and Optimization by Subject "Semidefinite Programming"
Now showing items 1-5 of 5
-
A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM
(University of Waterloo, 2020-12-18)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 ... -
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
(University of Waterloo, 2014-09-03)The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue ... -
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems
(University of Waterloo, 2001)It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ... -
Numerical Stability in Linear Programming and Semidefinite Programming
(University of Waterloo, 2006)We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. ... -
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
(University of Waterloo, 2007-05-18)Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound ...