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

DOI10.1007/S10898-005-3883-8MaRDI QIDQ2494476zbMATH OpenOpenAlexFDO

Authors 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 geometryGlobal optimizationMinimal ellipsoid

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Computational aspects related to convexity (52B55)

Recommendations

• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
• Minimal ellipsoids and their duals
• scientific article; zbMATH DE number 221630
• Minimal ellipsoids and maximal simplexes in 3D Euclidean space
• Ellipses of minimal area and of minimal eccentricity circumscribed about a convex quadrilateral
• Minimum Ellipsoids
• Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
• Minimal area conics in the elliptic plane
• Minimum-volume enclosing ellipsoids and core sets

Cites work

• 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
• An Algorithm for Separable Nonconvex Programming Problems
• An Algorithm for Separating Patterns by Ellipsoids
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
• Computation of Minimum-Volume Covering Ellipsoids
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Mean-absolute deviation portfolio optimization model under transaction costs
• On Numerical Solution of the Maximum Volume Ellipsoid Problem
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• The Minimum Covering Sphere Problem

Cited in

(4)

• On Numerical Solution of the Maximum Volume Ellipsoid Problem
• Fast algorithms for the minimum volume estimator
• Finding minimum volume circumscribing ellipsoids using generalized copositive programming
• Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares

Describes a project that uses

Uses Software

• MVE
• cdd

This page was built for publication: Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494476)