Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How to calculate the distance between a convex polytope and a point?
Polytope is specified as the solution to the system of linear inequalities.

I'm looking for the method that is computationally efficient.

share|cite|improve this question
Have you considered the methods described at ? – Mariano Suárez-Alvarez Feb 25 '11 at 15:08
Correct me if I'm wrong. Using QD I can find a point from the polytope which is the closest one to the given point. If this polytope is given by a system of linear equalities then I can use Lagrange Multiplier with multiple constraints to solve QD and this can be done by solving linear system of equations with $n+m$ variables. The complexity of this method is $O((n+m)^{3})$ – Tomek Tarczynski Feb 25 '11 at 17:58
Of course instead of QD I should write QP... – Tomek Tarczynski Feb 25 '11 at 18:04

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.