4.4 Article

Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection

期刊

INFORMS JOURNAL ON COMPUTING
卷 30, 期 1, 页码 31-42

出版社

INFORMS
DOI: 10.1287/ijoc.2017.0763

关键词

Fourier-Motzkin elimination; maximum volume inscribed ellipsoid; polytopic projection; Chebyshev center; removing redundant constraints; adjustable robust optimization

资金

  1. Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) [613.001.208]

向作者/读者索取更多资源

We introduce a novel scheme based on a blending of Fourier-Motzkin elimination (FME) and adjustable robust optimization techniques to compute the maximum volume inscribed ellipsoid (MVE) in a polytopic projection. It is well-known that deriving an explicit description of a projected polytope is NP-hard. Our approach does not require an explicit description of the projection, and can easily be generalized to find a maximally sized convex body of a polytopic projection. Our obtained MVE is an inner approximation of the projected polytope, and its center is a centralized relative interior point of the projection. Since FME may produce many redundant constraints, we apply an LP-based procedure to keep the description of the projected polytopes at its minimal size. Furthermore, we propose an upper bounding scheme to evaluate the quality of the inner approximations. We test our approach on a simple polytope and a color tube design problem, and observe that as more auxiliary variables are eliminated, our inner approximations and upper bounds converge to optimal solutions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据