Výsledky vyhledávání - "Todd, Michael J."

Report

Autor: Todd, Michael J.

We reconsider the ellipsoid method for linear inequalities. Using the ellipsoid representation of Burrell and Todd, we show the method can be viewed as coordinate descent on the volume of an enclosing ellipsoid, or on a potential function, or on both

Externí odkaz: http://arxiv.org/abs/2301.07632

Zobrazit plný text záznamu

Report

An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities

Autor: Lamperski, Jourdain, Freund, Robert M., Todd, Michael J.

The ellipsoid algorithm is a fundamental algorithm for computing a solution to the system of $m$ linear inequalities in $n$ variables $(P): A^{\top}x \le u$ when its set of solutions has positive volume. However, when $(P)$ is infeasible, the ellipso

Externí odkaz: http://arxiv.org/abs/1910.03114

Zobrazit plný text záznamu

Akademický článek

ACR Appropriateness Criteria® Routine Chest Imaging

Autor: Bang, Tami J., Chung, Jonathan H., Walker, Christopher M., Brixey, Anupama G., Christensen, Jared D., Faiz, Saadia A., Hanak, Michael, Hobbs, Stephen B., Kandathil, Asha, Little, Brent P., Madan, Rachna, Moore, William H., Richman, Ilana B., Setters, Belinda, Todd, Michael J., Yang, Stephen C., Donnelly, Edwin F.

Publikováno v: In Journal of the American College of Radiology May 2023 20(5) Supplement:S224-S233

Zobrazit plný text záznamu

Report

Can $n^d + 1$ unit right $d$-simplices cover a right $d$-simplex with shortest side $n + \epsilon$?

Autor: Todd, Michael J.

In a famous short paper, Conway and Soifer show that $n^2 + 2$ equilateral triangles with edge length 1 can cover one with side $n + \epsilon$. We provide a generalization to $d$ dimensions.
Comment: 4 pages

Externí odkaz: http://arxiv.org/abs/1711.08497

Zobrazit plný text záznamu

Report

An improved Kalai-Kleitman bound for the diameter of a polyhedron

Autor: Todd, Michael J.

Kalai and Kleitman established the bound $n^{\log(d) + 2}$ for the diameter of a $d$-dimensional polyhedron with $n$ facets. Here we improve the bound slightly to $(n-d)^{\log(d)}$.
Comment: 4 pages

Externí odkaz: http://arxiv.org/abs/1402.3579

Zobrazit plný text záznamu