A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

Authors:
Kazuyuki Sekitani;Yoshitsugu Yamamoto
Affiliations:
-;-
Venue:
Mathematical Programming: Series A and B
Year:
1993

Citing 0
Cited 4

An efficient, exact, and generic quadratic programming solver for geometric optimization

Proceedings of the sixteenth annual symposium on Computational geometry
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

Journal of Global Optimization
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

Computational Optimization and Applications
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract