Browsing Combinatorics and Optimization by Subject "Optimization"
Now showing items 1-5 of 5
-
Algorithmic and Linear Programming-Based Techniques for the Maximum Utility Problem
(University of Waterloo, 2023-05-25)A common topic of study in the subfield of Operations Research known as Revenue Management is finding optimal prices for a line of products given customer preferences. While there exists a large number of ways to model ... -
Analyzing Quantum Cryptographic Protocols Using Optimization Techniques
(University of Waterloo, 2012-05-22)This thesis concerns the analysis of the unconditional security of quantum cryptographic protocols using convex optimization techniques. It is divided into the study of coin-flipping and oblivious transfer. We first examine ... -
Applications of Semidefinite Programming in Quantum Cryptography
(University of Waterloo, 2007-05-18)Coin-flipping is the cryptographic task of generating a random coin-flip between two mistrustful parties. Kitaev discovered that the security of quantum coin-flipping protocols can be analyzed using semidefinite programming. ... -
Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization
(University of Waterloo, 2019-07-15)We consider the application of stochastic gradient descent (SGD) to the nonnegative matrix factorization (NMF) problem and the unconstrained low-rank matrix factorization problem. While the literature on the SGD algorithm ... -
Dynamic Programming: Salesman to Surgeon
(University of Waterloo, 2013-05-15)Dynamic Programming is an optimization technique used in computer science and mathematics. Introduced in the 1950s, it has been applied to many classic combinatorial optimization problems, such as the Shortest Path Problem, ...