Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"dual algorithm"”.
-
Combinatorial optimization problems with concave costs
… of polynomial-time heuristics, approximation algorithms, and exact algorithms for classical combinatorial optimization problems immediately yield polynomial-time heuristics, approximation algorithms, and fully polynomial-time approximation schemes for the corresponding concave cost problems. …
-
Integrating automatic generation control and demand response via a dynamic regulation market mechanism
… Power Flow problem and an iterative primal-dual algorithm based on Newton-Raphson is proposed to solve the problem. Next, the physical layer is coupled with the market layer. Market negotiations serve as set-point commands to the physical system, while Area Control Error is fed back from the …
-
Online optimization problems
… information is available. We design and analyze algorithms for a variety of online problems, including traveling salesman problems with rejection options, generalized assignment problems, stochastic matching problems, and resource allocation problems. We use worst case competitive ratios to …
-
Challenges in recommender systems : scalability, privacy, and structured recommendations
… We first develop a scalable primal dual algorithm for matrix completion based on trace norm regularization. The regularization problem is solved via a constraint generation method that explicitly maintains a sparse dual and the corresponding low rank primal solution. We provide a new …
-
Learning and Optimization in Modern Retail
… optimization problem and propose a novel primal-dual algorithm with provable performance guarantees that is robust to the demand process and does not require any explicit forecast. We then turn our attention to the problem of learning customer preferences using aggregated demand from multiple …
-
Min Cost Flow in balancierten Netzwerken mit konvexer Kostenfunktion
… Stone. Using these results we present several algorithms to solve the Convex BMCF problem. We present the first complete version of the Primal-Dual algorithm previously studied by Fremuth-Paeger and Jungnickel. However, we only consider the case of positive costs. We also show how to apply this …
-
Single video performance analysis for video-on-demand systems
We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is the amount of server load; we wish to minimize the total download rate for all users from the server and maximize …