Abstract:
In this paper we study practical solution methods for finding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in! n defined by a finite set of linear inequalities. Our goal is to design a general-purpose algorithmic framework that is reliable and efficient in practice. To evaluate the merit of a practical algorithm, we consider two key factors: the computational cost per iteration and the typical number of iterations required for convergence. In addition, numerical stability is also an important factor. We investigate some new formulations upon which we build primal-dual type, interior-point algorithms, and we provide theoretical justifications for the proposed formulations and algorithmic framework. Extensive numerical experiments have shown that one of the new algorithms should be the method of choice among the tested algorithms. 1
Citations
|
1889
|
Matrix Analysis
– Horn, Johnson
- 1985
|
|
972
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
259
|
A polynomial algorithm in linear programming
– Khachiyan
- 1979
|
|
150
|
Primal-dual interior-point methods for self-scaled cones
– NESTEROV, TODD
- 1998
|
|
137
|
Integer programming with a fixed number of variables
– Lenstra
- 1983
|
|
122
|
Smallest enclosing disks (balls and ellipsoids
– Welzl, Jun
- 1991
|
|
100
|
Extremum problems with inequalities as subsidiary conditions, Studies and Essays, presented to R. Courant on his 60th birthday, Interscience
– John
- 1948
|
|
72
|
An Algorithmic Theory of Numbers, Graphs and Convexity
– Lov'asz
- 1986
|
|
35
|
unknown title
– Kannan, Lovasz, et al.
- 1997
|
|
31
|
On the randomized complexity of volume and diameter
– Lovasz, Simonovits
- 1992
|
|
22
|
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
– Khachiyan, Todd
- 1993
|
|
19
|
The method of inscribed ellipsoids
– Tarasov, Khachiyan, et al.
- 1988
|
|
16
|
Rounding of polytopes in the real number model of computation
– Khachiyan
- 1996
|
|
9
|
An interior-point algorithm for the maximum-volume ellipsoid problem
– Zhang
- 1998
|
|
5
|
Improved complexity for maximum volume inscribed ellipsoids
– Anstreicher
- 2001
|
|
5
|
A geometric approach to optimal design theory
– Silvey, Titterington
- 1973
|
|
2
|
A random polynomial-time algorithm for estimating volumes of convex bodies
– Dyer, Frieze, et al.
- 1991
|
|
2
|
On self-concordant convex-concave functions
– Nemirovski
- 1997
|
|
2
|
Determinant maximization with matrix inequality constraints
– Vandenberghe, Boyd, et al.
- 1996
|
|
1
|
Optimal design: Some geometric aspects of d-optimality
– Titteringto
- 1975
|
|
