Ellipsoidal approximations of convex sets based on the volumetric barrier

Mathematics of Operations Research

Volumn 24, Issue 1, 1999, Pages 193-203

  Anstreicher, K M ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MATRIX ALGEBRA; SET THEORY;

CONVEX SETS; ELLIPSOIDAL APPROXIMATION METHODS; VOLUMETRIC BARRIERS;

OPERATIONS RESEARCH;

EID: 0033076321     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.1.193     Document Type: Article

References (16)

1. Anstreicher, K. M. 1996. Large step volumetric potential reduction algorithms for linear programming. Ann. Oper. Res. 62 521-538.
2. _. 1997a. Volumetric path following algorithms for linear programming. Math. Programming 76 245-263.
3. _. 1997b. On Vaidya's volumetric cutting plane method for convex programming. Math. Oper. Res. 22 63-89.
4. _. 1999. Towards a practical volumetric cutting plane method for convex programming. SIAM J. Optim. 9 190-206.
5. Goffin, J.-L. 1984. Variable metric relaxation algorithms, Part II: The ellipsoid method. Math. Programming 30 147-162.
6. Grötschel, M., L. Lovász, A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin.
7. John, F. 1948. Extremum problems with inequalities as subsidiary conditions. Studies and Essays, Presented to R. Courant on his 60th Birthday, January 8, 1948. Wiley Interscience, New York, 187-204.
8. 5) volume algorithm for convex bodies. Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
9. Khachiyan, L. G. 1996. Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21 307-320.
10. _, M. J. Todd. 1993. On the complexity of approximating the maximum inscribed ellipsoid for a polytope. Math. Programming 61 137-159.
11. Kochol, M. 1994. Constructive approximation of a ball by polytopes. Math. Slovaca 44 99-105.
12. Nesterov, Y., A. Nemirovskii. 1994. Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia.
13. Ramaswamy, S., J. E. Mitchell. 1995. A long step cutting plane algorithm that uses the volumetric barrier. Dept. of Math. Sciences, Rensselaer Polytechnic Institute, Troy, NY.
14. Renegar, J. 1988. A polynomial-time algorithm, based on Newton's method, for linear programming. Math. Programming 40 59-93.
15. Schrijver, A. 1986. Theory of Linear and Integer Programing. Wiley, New York.
16. Vaidya, P. M. 1996. A new algorithm for minimizing convex functions over convex sets. Math. Programming 73 291-341.