Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6053913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rank-two update algorithms for the minimum volume enclosing ellipsoid problem |
scientific article; zbMATH DE number 6053913 |
Statements
Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (English)
0 references
10 July 2012
0 references
minimum volume ellipsoids
0 references
rank-two update algorithms
0 references
sequential minimal optimization
0 references
core sets
0 references
approximation algorithms
0 references
complexity analysis
0 references
0 references
0 references
0.8585261702537537
0 references
0.837840735912323
0 references
0.8302188515663147
0 references
0.8223963379859924
0 references
0.8191136717796326
0 references
