Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities

DOI10.1007/s10898-005-3883-8zbMath1098.90047MaRDI QIDQ2494476

Hiroshi Konno, Jun-Ya Gotoh

Publication date: 28 June 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=347&item_no=1&attribute_id=17&file_no=1

zbMATH Keywords

Computational geometry; Global optimization; Minimal ellipsoid

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

52B55: Computational aspects related to convexity

90C20: Quadratic programming

Uses Software

• cdd
• MVE

Cites Work

• Unnamed Item
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• A simple algorithm for computing the smallest enclosing circle
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• Lectures on Modern Convex Optimization
• On Numerical Solution of the Maximum Volume Ellipsoid Problem
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• An Algorithm for Separating Patterns by Ellipsoids
• Computation of Minimum-Volume Covering Ellipsoids
• An Algorithm for Separable Nonconvex Programming Problems
• The Minimum Covering Sphere Problem