A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems
Optimization and Control
2022-02-23 v2
Abstract
We define the notion of infimum of a set of points with respect to the second order cone. This problem can be showed to be equivalent to the minimum ball containing a set of balls problem and to the maximum intersecting ball problem, as well as others. We present a dual algorithm which can be viewed as an extension of the simplex method to solve this problem.
Cite
@article{arxiv.1812.01236,
title = {A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems},
author = {Marta Cavaleiro and Farid Alizadeh},
journal= {arXiv preprint arXiv:1812.01236},
year = {2022}
}