In this report, we consider the problem of finding the maximumvolume ellipsoid inscribing a given full-dimensional polytope in! n defined by a finite set of affine inequalities. We present several formulations for the problem that may serve as algorithmic frameworks for applying interior-point methods. We propose a practical interior-point algorithm based on one of the formulations and present preliminary numerical results. 1
|
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
|
|
144
|
A new polynomial time algorithm for linear programming
– Karmarkar
- 1984
|
|
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
|
|
60
|
Theory and Algorithms for Linear Optimization: An Interior Point Approach
– Vial
- 1997
|
|
35
|
unknown title
– Kannan, Lovasz, et al.
- 1997
|
|
31
|
On the randomized complexity of volume and diameter
– Lovasz, Simonovits
- 1992
|
|
25
|
The generalized basis reduction algorithm
– Lovász, Scarf
- 1992
|
|
22
|
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
– Khachiyan, Todd
- 1993
|
|
22
|
Linear Programming: A Modern Integrated Analysis
– Saigal
- 1995
|
|
21
|
An implementation of the generalized basis reduction algorithm for integer programming
– Cook, Rutherford, et al.
- 1993
|
|
20
|
Factoring Polynomials with Rational Coefficients,Math
– Lovasz
- 1982
|
|
16
|
Rounding of polytopes in the real number model of computation
– Khachiyan
- 1996
|
|
16
|
Optimal design: some geometrical aspect of D-optimality, Biometrika 62(3
– Titterington
- 1975
|
|
8
|
A continuous method for computing bounds in integer quadratic optimization problems
– Kamath, Karmarkar
- 1992
|
|
5
|
A geometric approach to optimal design theory
– Silvey, Titterington
- 1973
|
|
4
|
Ellipsoidal approximations of convex sets based on the volumetric barrier
– Anstreicher
- 1999
|
|
4
|
Interior Point Methods of Mathematical Programming
– Terlaky
- 1996
|
|
3
|
On the formulation of the primal-dual Newton interior-point method for nonlinear programming
– El-Bakry, Tapia, et al.
- 1996
|
|
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
|
The method of inscribed ellipsoid. Soviet Mathematics Doklady 37
– Tarasov, Khachiyan, et al.
- 1988
|
|
2
|
Determinant maximization with matrix inequality constraints
– Vandenberghe, Boyd, et al.
- 1996
|
|
