Text

Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming

We study the problem of finding the Löwner–John ellipsoid (i.e., an ellipsoid with minimum volume that contains a given convex set). We reformulate the problem as a generalized copositive program and use that reformulation to derive tractable semidefinite programming approximations for instances where the set is defined by affine and quadratic inequalities. We prove that, when the underlying set is a polytope, our method never provides an ellipsoid of higher volume than the one obtained by scaling the maximum volume-inscribed ellipsoid. We empirically demonstrate that our proposed method generates high-quality solutions and can be solved much faster than solving the problem to optimality. Furthermore, we outperform the existing approximation schemes in terms of solution time and quality. We present applications of our method to obtain piecewise linear decision rule approximations for dynamic distributionally robust problems with random recourse and to generate ellipsoidal approximations for the set of reachable states in a linear dynamical system when the set of allowed controls is a polytope.

Ketersediaan

Informasi Detail

Judul Seri

OPERATIONS RESEARCH; Vol.70 No.5 September-October 2022

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 2867-2882

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

SEMIDEFINITE PROGRAMMING
COPOSITIVE PROGRAMMING
DISTRIBUTIONALLY ROBUST OPTIMIZATION
MINIMUM VOLUME ELLIPSOIDS

Info Detail Spesifik

https://doi.org/10.1287/opre.2021.2156

Pernyataan Tanggungjawab

Areesh Mittal, Grani A. Hanasusanto

Versi lain/terkait

Lampiran Berkas

Komentar