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

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

2009-04-03

arxiv.org/abs/0904.0583v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150967