Browsing Theses by Subject "Convex Optimization"
Now showing items 1-9 of 9
-
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 ... -
A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem
(University of Waterloo, 2007-04-20)The minimum k-partition (MkP) problem is a well-known optimization problem encountered in various applications most notably in telecommunication and physics. Formulated in the early 1990s by Chopra and Rao, the MkP ... -
A Convergent Hierarchy of Certificates for Constrained Signomial Positivity
(University of Waterloo, 2020-09-24)Optimization is at the heart of many engineering problems. Many optimization problems, however, are computationally intractable. One approach to tackle such intractability is to find a tractable problem whose solution, ... -
Granger Causal Network Learning and the Depth Wise Grouped LASSO
(University of Waterloo, 2017-08-31)In this thesis we study the notion of Granger-causality, a statistical concept originally developed to estimate causal effects in econometrics. First, we suggest a more general notion of Granger-causality in which to frame ... -
An Improved Convex Optimization Model for Two-Dimensional Facility Layout
(University of Waterloo, 2007-01-23)The facility layout design problem is a fundamental optimization problem encountered in many manufacturing and service organizations that was originally formulated in 1963 by Armour & Buffa. This thesis derives a convex ... -
Interference Management in Non-cooperative Networks
(University of Waterloo, 2009-10-27)Spectrum sharing is known as a key solution to accommodate the increasing number of users and the growing demand for throughput in wireless networks. While spectrum sharing improves the data rate in sparse networks, it ... -
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 ... -
Novel Convex Optimization Approaches for VLSI Floorplanning
(University of Waterloo, 2008-05-15)The floorplanning problem aims to arrange a set of rectangular modules on a rectangular chip area so as to optimize an appropriate measure of performance. This problem is known to be NP-hard, and is particularly challenging ... -
On the Relationship between Conjugate Gradient and Optimal First-Order Methods for Convex Optimization
(University of Waterloo, 2014-01-23)In a series of work initiated by Nemirovsky and Yudin, and later extended by Nesterov, first-order algorithms for unconstrained minimization with optimal theoretical complexity bound have been proposed. On the other hand, ...