Pith. sign in

REVIEW 1 cited by

The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0709.0707 v1 pith:HQAKYNG2 submitted 2007-09-05 math.MG math.FA

classification math.MGmath.FA
keywords convexellipsoidsextremalbodyellipsoidprogrammingvolumeautomorphism
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A convex body K has associated with it a unique circumscribed ellipsoid CE(K) with minimum volume, and a unique inscribed ellipsoid IE(K) with maximum volume. We first give a unified, modern exposition of the basic theory of these extremal ellipsoids using the semi-infinite programming approach pioneered by Fritz John in his seminal 1948 paper. We then investigate the automorphism groups of convex bodies and their extremal ellipsoids. We show that if the automorphism group of a convex body K is large enough, then it is possible to determine the extremal ellipsoids CE(K) and IE(K) exactly, using either semi-infinite programming or nonlinear programming. As examples, we compute the extremal ellipsoids when the convex body K is the part of a given ellipsoid between two parallel hyperplanes, and when K is a truncated second order cone or an ellipsoidal cylinder.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach

    stat.ML 2026-06 unverdicted novelty 6.0 of 10

    Proposes SME-OFU algorithm for SLCB with bounded noise achieving O(log T) regret via set-membership estimation and OFU.

Pith tools