# A faster dual algorithm for the Euclidean minimum covering ball problem

arXiv: https://arxiv.org/abs/1706.10256 · HTML: https://mlsanity.com/paper/1706.10256/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jun 2017.

## Built on by (most cited first, 1 of 1)

- [On Linear Separability of the MNIST Handwritten Digits Dataset](https://mlsanity.com/paper/2603.12850/) (2026)

## Abstract (arXiv)

Dearing and Zeck presented a dual algorithm for the problem of the minimum covering ball in ℝn. Each iteration of their algorithm has a computational complexity of at least mathcal O(n3). In this paper we propose a modification to their algorithm that, together with an implementation that uses updates to the QR factorization of a suitable matrix, achieves a mathcal O(n2) iteration.