A note on approximation of a ball by polytopes

Discrete Optimization - Tập 1 - Trang 229-231 - 2004
Martin Kochol1
1MÚ SAV, Štefánikova 49, 814 73 Bratislava 1, Slovakia

Tài liệu tham khảo

Anstreicher, 1997, On Vaidya's volumetric cutting plane method for convex programming, Math. Oper. Res., 22, 63, 10.1287/moor.22.1.63 Anstreicher, 1999, Ellipsoidal approximation of convex sets based on the volumetric barrier, Math. Oper. Res., 24, 193, 10.1287/moor.24.1.193 K.M. Anstreicher, Personal communication. Ball, 1990, Convex bodies with few faces, Proc. Amer. Math. Soc., 110, 225, 10.1090/S0002-9939-1990-1019270-8 Bárány, 1987, Computing the volume is difficult, Discrete Comput. Geom., 2, 319, 10.1007/BF02187886 Bárány, 1988, Approximation of the sphere by polytopes having few vertices, Proc. Amer. Math. Soc., 102, 651, 10.2307/2047241 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. Brieden, 2001, Deterministic and randomized polynomial-time approximation of radii, Mathematika, 28, 63, 10.1112/S0025579300014364 Carl, 1985, Inequalities of Berstein–Jackson-type and the degree of compactness of operators in Banach spaces, Ann. Inst. Fourier (Grenoble), 35, 79, 10.5802/aif.1020 Carl, 1988, Gelfand numbers of operators with values in a Hilbert space, Invent. Math., 94, 479, 10.1007/BF01394273 Gritzmann, 1993, Computational complexity of inner and outer j-radii of polytopes in finite dimensional normed spaces, Math. Programming, 59, 163, 10.1007/BF01581243 M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Second ed., Springer, Berlin, 1988, 1993. Gruber, 1994, Approximation by convex polytopes, 173 Klee, 1995, Convex polytopes and related complexes, 875 Kochol, 1994, Constructive approximation of a ball by polytopes, Math. Slovaca, 44, 99 Matoušek, 2002 Simonovits, 2003, How to compute the volume in high dimension?, Math. Programming, 97, 337, 10.1007/s10107-003-0447-x Vaidya, 1996, A new algorithm for minimizing convex functions over convex sets, Math. Programming, 73, 291, 10.1007/BF02592216