Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
In this paper, we consider linear systems in input-output form and introduce a new adaptive linear quadratic Gaussian (LQG) control scheme which is shown to be self-optimizing. The...
We introduce a new framework supporting the bottleneck analysis of closed, multiclass BCMP queueing networks in the limiting regime where the number of jobs proportionally grows t...