Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching
dc.contributor.author | Kudela, Jakub | |
dc.coverage.issue | 2 | cs |
dc.coverage.volume | 25 | cs |
dc.date.accessioned | 2020-05-05T07:21:11Z | |
dc.date.available | 2020-05-05T07:21:11Z | |
dc.date.issued | 2019-12-20 | cs |
dc.description.abstract | 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 implementation yields significant improvements on the runtime of the algorithm for large-scale instances of the MVCE problem, which is demonstrated on quite extensive computational experiments. | en |
dc.format | text | cs |
dc.format.extent | 19-26 | cs |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Mendel. 2019 vol. 25, č. 2, s. 19-26. ISSN 1803-3814 | cs |
dc.identifier.doi | 10.13164/mendel.2019.2.019 | en |
dc.identifier.issn | 2571-3701 | |
dc.identifier.issn | 1803-3814 | |
dc.identifier.uri | http://hdl.handle.net/11012/187000 | |
dc.language.iso | en | cs |
dc.publisher | Institute of Automation and Computer Science, Brno University of Technology | cs |
dc.relation.ispartof | Mendel | cs |
dc.relation.uri | https://mendel-journal.org/index.php/mendel/article/view/104 | cs |
dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license | en |
dc.rights.access | openAccess | en |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0 | en |
dc.subject | minimum-volume covering ellipsoid | en |
dc.subject | Lowner-John ellipsoid | en |
dc.subject | large-scale optimization | en |
dc.subject | Wolfe-Atwood algorithm | en |
dc.subject | pooling | en |
dc.subject | batching | en |
dc.title | Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching | en |
dc.type.driver | article | en |
dc.type.status | Peer-reviewed | en |
dc.type.version | publishedVersion | en |
eprints.affiliatedInstitution.faculty | Fakulta strojního inženýrství | cs |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 2019-2-019.pdf
- Size:
- 933.02 KB
- Format:
- Adobe Portable Document Format
- Description: