A note on approximation of a ball by polytopes

Discrete Optimization

Volumn 1, Issue 2, 2004, Pages 229-231

  Kochol, Martin ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Approximation; Polytope; Unit ball; Volumetric cutting plane algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; SET THEORY; THEOREM PROVING;

GAMMA-FUNCTIONS; POLYTOPES; POSITIVE INTEGERS; UNIT BALLS; VOLUMETRIC CUTTING PLANE ALGORITHMS;

POLYNOMIALS;

EID: 13944251088     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2004.07.003     Document Type: Article

References (18)

1. K.M. Anstreicher On Vaidya's volumetric cutting plane method for convex programming Math. Oper. Res. 22 1997 63 89
2. K.M. Anstreicher Ellipsoidal approximation of convex sets based on the volumetric barrier Math. Oper. Res. 24 1999 193 203
3. K.M. Anstreicher, Personal communication.
4. K. Ball, and A. Pajor Convex bodies with few faces Proc. Amer. Math. Soc. 110 1990 225 231
5. I. Bárány, and Z. Füredi Computing the volume is difficult Discrete Comput. Geom. 2 1987 319 326
6. I. Bárány, and Z. Füredi Approximation of the sphere by polytopes having few vertices Proc. Amer. Math. Soc. 102 1988 651 659
7. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, M. Simonovits, Approximation of radii and norm-maxima: randomization doesn't help, Proceeding of the 39th IEEE FOCS, 1998, pp. 244-251.
8. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simonovits Deterministic and randomized polynomial-time approximation of radii Mathematika 28 2001 63 105
9. B. Carl Inequalities of Berstein-Jackson-type and the degree of compactness of operators in Banach spaces Ann. Inst. Fourier (Grenoble) 35 1985 79 118
10. B. Carl, and A. Pajor Gelfand numbers of operators with values in a Hilbert space Invent. Math. 94 1988 479 504
11. P. Gritzmann, and V. Klee Computational complexity of inner and outer j-radii of polytopes in finite dimensional normed spaces Math. Programming 59 1993 163 213
12. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Second ed., Springer, Berlin, 1988, 1993.
13. P.M. Gruber Approximation by convex polytopes T. Bisztriczky P. McMullen R. Schneider A.I. Weiss Polytopes Abstract, Convex and Computational 1994 Kluwer Academic Publishers Dordrecht 173 203
14. V. Klee, and P. Kleinschmidt Convex polytopes and related complexes R.L. Graham M. Grötschel L. Lovász Handbook of Combinatorics 1995 North-Holland Amsterdam 875 917
15. M. Kochol Constructive approximation of a ball by polytopes Math. Slovaca 44 1994 99 105
16. J. Matoušek Lectures on Discrete Geometry 2002 Springer New York
17. M. Simonovits How to compute the volume in high dimension? Math. Programming 97 2003 337 394
18. P.M. Vaidya A new algorithm for minimizing convex functions over convex sets Math. Programming 73 1996 291 341