In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...
Adaptive robust optimization problems are usually solved approximately by restricting the adaptive decisions to simple parametric decision rules. However, the corresponding approximation error can be substantial. In this paper we show that two-stage robust ...
Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...
Classical mechanical watch plain bearing pivots have frictional losses limiting the quality factor of the hairspring-balance wheel oscillator. Replacement by flexure pivots leads to a drastic reduction in friction and an order of magnitude increase in qual ...
Standard algorithm of building’s energy strategy often use electricity and its tariff as the sole criterion of choice. This paper introduced an algorithmic regulation using global warming potential (GWP) of energy flux, to select which installation will sa ...
We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distribut ...
This paper presents a coordinated primal-dual interior point (PDIP) method for solving structured convex linear and quadratic programs (LP-QP) in a distributed man- ner. The considered class of problems represents a multi-agent setting, where the aggregate ...
