Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important optimization problem that comes up in various areas of engineering and statistics. In this paper, we improve the state-of-the-art Wolfe-Atwood algorithm for solving the MVCE problem with pooling and batching procedures. This imple...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Brno University of Technology
2019-12-01
|
| Series: | Mendel |
| Subjects: | |
| Online Access: | https://mendel-journal.org/index.php/mendel/article/view/104 |