Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
type: Item
instance of: scholarly article
title: Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
zbMATH Open document ID: 0801.90090
DOI: 10.1007/BF01300973
author: Hiroshi Konno
author: Yasutoshi Yajima
author: Ayumi Ban
published in: Computational Optimization and Applications
publication date: 1994-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 52A40
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 569208
zbMATH Keywords: outer approximation
zbMATH Keywords: computational geometry
zbMATH Keywords: minimal sphere
zbMATH Keywords: convex quadratic function
MaRDI profile type: Publication
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: The Minimum Covering Sphere Problem
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: Q4209438
cites work: An algorithm for nonconvex programming problems
cites work: On the convergence of global methods in multiextremal optimization
cites work: Q3997222
cites work: A cutting plane algorithm for solving bilinear programs
cites work: Quasi-concave minimization subject to linear constraints
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
cites work: A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
cites work: A simple algorithm for computing the smallest enclosing circle
cites work: Efficient algorithms for solving rank two and rank three bilinear programming problems
cites work: OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
cites work: Global Maximization of a Convex Function with Linear Inequality Constraints
description: scientific article; zbMATH DE number 569208