A dual simplex-type algorithm for the smallest enclosing ball of balls

Document Type

Article

Publication Date

7-1-2021

Abstract

We develop a dual simplex-type algorithm for computing the smallest enclosing ball of a set of balls and other closely related problems. Our algorithm employs a pivoting scheme resembling the simplex method for linear programming, in which a sequence of exact curve searches is performed until a new dual feasible solution with a strictly smaller objective function value is found. We utilize the Cholesky factorization and procedures for updating it, yielding a numerically stable implementation of the algorithm. We show that our algorithm can efficiently solve instances of dimension 5000 with 100000 points, often within minutes.

Identifier

85106504263 (Scopus)

Publication Title

Computational Optimization and Applications

External Full Text Location

https://doi.org/10.1007/s10589-021-00283-6

e-ISSN

15732894

ISSN

09266003

First Page

767

Last Page

787

Issue

3

Volume

79

This document is currently not available here.

Share

COinS