scientific article; zbMATH DE number 4114428
From MaRDI portal
Publication:4729639
zbMATH Open0679.90095MaRDI QIDQ4729639FDOQ4729639
Authors: V. N. Kalinin, E. V. Shikin 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
Numerical mathematical programming methods (65K05) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40) Mathematical programming (90C99)
Cited In (21)
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Construction of the ellipsoid of minimal volume for elementary polyhedrons
- For describing uncertainty, ellipsoids are better than generic polyhedra and probably better than boxes: a remark
- An algorithm for the parametric search of elliptic I- and S-hulls of a convex compactum
- Title not available (Why is that?)
- Construction of thinnest digital ellipsoid using inverse projection and recursive integer intervals
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- Elliptic polytopes and invariant norms of linear operators
- Minimum-volume ellipsoidal approximation of the sum of two ellipsoids
- Finding the extreme ellipsoid contained in the sum of two ellipsoids
- Numerical solution of extremal problems on constructing ellipsoids and parallelepipeds
- Minimum-volume ellipsoids. Theory and algorithms
- Minimal ellipsoids and maximal simplexes in 3D Euclidean space
- Title not available (Why is that?)
- An approximate method of ellipsoids
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Determining ellipsoids by intersections with flats
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- Title not available (Why is that?)
- Rounding of Polytopes in the Real Number Model of Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729639)
