Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families

Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a given star-shaped body. The complexity of the algorithm grows polynomially in the dimension and inverse polynomially in the fraction of the volume taken up by the kernel of the star-shaped body. The analysis is based on a new isoperimetric inequality. Our main technical contribution is a tool for proving such inequalities when the domain is not convex. As a consequence, we obtain a polynomial algorithm for computing the volume of such a set as well. In contrast, linear optimization over star-shaped sets is NP-hard.

[1]  Miklós Simonovits,et al.  Isoperimetric problems for convex bodies and a localization lemma , 1995, Discret. Comput. Geom..

[2]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[3]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[4]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[5]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

[6]  Timothy M. Chan.  Low-Dimensional Linear Programming with Violations , 2005, SIAM J. Comput..

[7]  S. Vempala,et al.  Hit-and-Run from a Corner , 2006 .

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  Pravin M. Vaidya,et al.  A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..

[10]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[11]  Peter Widmayer,et al.  k-Violation Linear Programming , 1994, Inf. Process. Lett..

[12]  Santosh S. Vempala,et al.  Solving convex programs by random walks , 2004, JACM.

[13]  Jirí Matousek.  On geometric optimization with few violated constraints , 1994, SCG '94.

[14]  George L. Nemhauser,et al.  An integer programming approach for linear programs with probabilistic constraints , 2007, Math. Program..

[15]  Santosh S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007, Random Struct. Algorithms.

[16]  Santosh S. Vempala,et al.  Hit-and-run from a corner , 2004, STOC '04.

[17]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.