Advanced Search

The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor $n$ (where $n$ is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...

We introduce the function $Z(x;\xi ,\nu ):={\int }_{-\infty }^x\varphi (t-\xi )·\Phi \left(\nu t\right)\text{d}t$, where $\varphi$ and $\Phi$ are the pdf and cdf of $N(0,1)$, respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in the case of small samples (where asymptotic results do not work), and in general for max-type random variables...