Minimal ellipsoids and maximal simplexes in 3D Euclidean space
From MaRDI portal
Publication:557434
DOI10.1023/B:CASA.0000020224.83374.d7zbMath1097.52004MaRDI QIDQ557434
Publication date: 30 June 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:casa.0000020224.83374.d7
90C25: Convex programming
90C90: Applications of mathematical programming
52A40: Inequalities and extremum problems involving convexity in convex geometry
Related Items
Multivariate ranking using elliptical peeling, Computing efficiently the lattice width in any dimension, Efficient Lattice Width Computation in Arbitrary Dimension