Calculating a minimal sphere containing a polytope defined by a system of linear inequalities

DOI10.1007/BF01300973zbMath0801.90090MaRDI QIDQ1326513

Ayumi Ban, Hiroshi Konno, Yasutoshi Yajima

Publication date: 1 December 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

outer approximationcomputational geometryminimal sphereconvex quadratic function

Mathematics Subject Classification ID

Convex programming (90C25) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (2)

Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities ⋮ Finding robust solutions for product design problems

Cites Work

• Unnamed Item
• 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 convergence of global methods in multiextremal optimization
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Quasi-concave minimization subject to linear constraints
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Global Maximization of a Convex Function with Linear Inequality Constraints
• An algorithm for nonconvex programming problems
• A cutting plane algorithm for solving bilinear programs
• A Successive Underestimation Method for Concave Minimization Problems
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
• The Minimum Covering Sphere Problem

This page was built for publication: Calculating a minimal sphere containing a polytope defined by a system of linear inequalities