Recent progress and open problems in algorithmic convex geometry

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 8, Issue , 2010, Pages 42-64

  Vempala, Santosh S ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCENTRATION INEQUALITY; CONVEX GEOMETRY; MATHEMATICAL TOOLS; RECENT PROGRESS;

GEOMETRY; SOFTWARE ENGINEERING;

ALGORITHMS;

EID: 84880207726     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2010.42     Document Type: Conference Paper

References (65)

1. R. Adamczak, A. Litvak, A. Pajor, and N. Tomczak-Jaegermann. Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles. J. Amer. Math. Soc., 23:535-561, 2010.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6:83-96, 1986.
3. D. Applegate and R. Kannan. Sampling and integration of near log-concave functions. In STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 156-163, New York, NY, USA, 1991. ACM.
4. K. M. Ball. Logarithmically concave functions and sections of convex sets in rn. Studia Mathematica, 88:69-84, 1988.
5. A. Belloni, R. M. Freund, and S. Vempala. An efficient rescaled perceptron algorithm for conic systems. Math. Oper. Res., 34(3):621-641, 2009.
6. D. Bertsimas and S. Vempala. Solving convex programs by random walks. J. ACM, 51(4):540-556, 2004.
7. S. Bobkov. On isoperimetric constants for log-concave probability distributions. Geometric aspects of functional analysis, Lect. notes in Math., 1910:81-88, 2007.
8. J. Bourgain. Random points in isotropic convex sets. Convex geometric analysis, 34:53-58, 1996.
9. K. Chandrasekaran, D. Dadush, and S. Vempala. Thin partitions: Isoperimetric inequalities and a sampling algorithm for star shaped bodies. In SODA, pages 1630-1645, 2010.
10. K. Chandrasekaran, A. Deshpande, and S. Vempala. Sampling s-concave functions: The limit of convexity based isoperimetry. In APPROX-RANDOM, pages 420-433, 2009.
11. P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of markov chains. Ann. Appl. Probab., 1(1):36-61, 1991.
12. A. Dinghas. Uber eine klasse superadditiver mengenfunktionale vonbrunn-minkowskilusternik-schem typus. Math. Zeitschr., 68:111-125, 1957.
13. J. Dunagan and S. Vempala. A simple polynomial-time rescaling algorithm for solving linear programs. Math. Prog., 114(1):101-114, 2008.
14. M. E. Dyer and A. M. Frieze. Computing the volume of a convex body: a case where randomness provably helps. In Proc. of AMS Symposium on Probabilistic Combinatorics and Its Applications, pages 123-170, 1991.
15. M. E. Dyer, A. M. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. In STOC, pages 375-381, 1989.
16. M. E. Dyer, A. M. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991.
17. R. Eldan. A polynomial number of random points does not determine the volume of a convex body. http://arxiv.org/abs/0903.2634, 2009.
18. R. Eldan and B. Klartag. Approximately gaussian marginals and the hyperplane conjecture. http://arxiv.org/abs/1001.0875, 2010.
19. B. Fleury. Concentration in a thin euclidean shell for log-concave measures. J. Funct. Anal., 259(4):832-841, 2010.
20. N. Goyal and L. Rademacher. Learning convex bodies is hard. In COLT, 2009.
21. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.
22. B. Grunbaum. Partitions of mass-distributions and convex bodies by hyperplanes. Pacific J. Math., 10:1257-1261, 1960.
23. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM, 51(4):671-697, 2004.
24. M. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43:169-188, 1986.
25. A. T. Kalai and S. Vempala. Simulated annealing for convex optimization. Math. Oper. Res., 31(2):253-266, 2006.
26. R. Kannan. Minkowski's convex body theorem and integer programming. Math. Oper. Res., 12(3):415-440, 1987.
27. R. Kannan, L. Lovász, and M. Simonovits. Isoperimetric problems for convex bodies and a localization lemama. Discrete & Computational Geometry, 13:541-559, 1995.
28. 5) volume algorithm for convex bodies. Random Structures and Algorithms, 11:1-50, 1997.
29. R. Kannan and H. Narayanan. Random walks on polytopes and an affine interior point method for linear programming. In STOC, pages 561-570, 2009.
30. R. Kannan and S. Vempala. Sampling lattice points. In STOC, pages 696-700, 1997.
31. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-396, 1984.
32. R. M. Karp and C. H. Papadimitriou. On linear characterization of combinatorial optimization problems. SIAM J. Comp., 11:620-632, 1982.
33. J. A. Kelner and D. A. Spielman. A randomized polynomial-time simplex algorithm for linear programming. In STOC, pages 51-60, 2006.
34. L. G. Khachiyan. Polynomial algorithms in linear programming. USSR Computational Mathematics and Mathematical Physics, 20:53-72, 1980.
35. B. Klartag. On convex perturbations with a bounded isotropic constant. Geom. and Funct. Anal., 16(6):1274-1290, 2006.
36. B. Klartag. A central limit theorem for convex sets. Invent. Math., 168:91-131, 2007.
37. B. Klartag. Power-law estimates for the central limit theorem for convex sets. J. Funct. Anal., 245:284-310, 2007.
38. A. R. Klivans, Ryan O'Donnell, and R. A. Servedio. Learning geometric concepts via gaussian surface area. In FOCS, pages 541-550, 2008.
39. L. Leindler. On a certain converse of Hölder's inequality ii. Acta Sci. Math. Szeged, 33:217-223, 1972.
40. H. W. Lenstra. Integer programming with a fixed number of variables. Math. of Oper. Res., 8(4):538-548, 1983.
41. L. Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity, volume 50 of CBMS-NSF Conference Series. SIAM, 1986.
42. L. Lovász. Hit-and-run mixes fast. Math. Prog., 86:443-461, 1998.
43. L. Lovász and M. Simonovits. On the randomized complexity of volume and diameter. In Proc. 33rd IEEE Annual Symp. on Found. of Comp. Sci., pages 482-491, 1992.
44. L. Lovász and M. Simonovits. Random walks in a convex body and an improved volume algorithm. In Random Structures and Alg., volume 4, pages 359-412, 1993.
45. L. Lovász and S. Vempala. Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. In FOCS, pages 57-68, 2006.
46. L. Lovász and S. Vempala. Hit-and-run from a corner. SIAM J. Computing, 35:985-1005, 2006.
47. 4) volume algorithm. J. Comput. Syst. Sci., 72(2):392-417, 2006.
48. L. Lovász and S. Vempala. The geometry of logconcave functions and sampling algorithms. Random Structures and Algorithms, 30(3):307-358, 2007.
49. J. Luedtke, S. Ahmed, and G. L. Nemhauser. An integer programming approach for linear programs with probabilistic constraints. Math. Program., 122(2):247-272, 2010.
50. E. Milman. On the role of convexity in isoperimetry, spectral gap and concentration. Invent. Math., 177(1):1-43, 2009.
51. V. Milman and A. Pajor. Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space. Geometric aspects of Functional Analysis, Lect. notes in Math., pages 64-104, 1989.
52. Yu. Nesterov and A. Nemirovski. Interior-Point Polynomial Algorithms in Convex Programming. Studies in Applied Mathematics. SIAM, 1994.
53. M. W. Padberg and M. R. Rao. The russian method for linear programming iii: Bounded integer programming. NYU Research Report, 1981.
54. G. Paouris. Concentration of mass on convex bodies. Geometric and Functional Analysis, 16:1021-1049, 2006.
55. A. Prekopa. Logarithmic concave measures and functions. Acta Sci. Math. Szeged, 34:335-343, 1973.
56. A. Prekopa. On logarithmic concave measures with applications to stochastic programming. Acta Sci. Math. Szeged, 32:301-316, 1973.
57. M. Rudelson. Random vectors in the isotropic position. Journal of Functional Analysis, 164:60-72, 1999.
58. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation, 82:93-133, 1989.
59. D. Stefankovic, S. Vempala, and E. Vigoda. Adaptive simulated annealing: A near-optimal connection between sampling and counting. In FOCS, pages 183-193, Washington, DC, USA, 2007. IEEE Computer Society.
60. P. M. Vaidya. A new algorithm for minimizing convex functions over convex sets. Math. Prog., 73:291-341, 1996.
61. S. Vempala. A random sampling based algorithm for learning the intersection of half-spaces. In FOCS, pages 508-513, 1997.
62. S. Vempala. Geometric random walks: A survey. MSRI Combinatorial and Computational Geometry, 52:573-612, 2005.
63. S. Vempala. Learning convex concepts from gaussian distributions with PCA. In FOCS, 2010.
64. S. Vempala. A random sampling based algorithm for learning the intersection of half-spaces. JACM, to appear, 2010.
65. D. B. Yudin and A. S. Nemirovski. Evaluation of the information complexity of mathematical programming problems (in russian). Ekonomika i Matematicheskie Metody, 13(2):3-45, 1976.