Finding the projection on a polytope: An iterative method

DOI10.1016/0898-1221(96)00164-2zbMath0869.90087OpenAlexW2056102248MaRDI QIDQ1352784

O. Diekmann

Publication date: 19 February 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00164-2

zbMATH Keywords

projection of a point on a polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mathematical programming (90C99)

Related Items (3)

Hausdorff matching and Lipschitz optimization ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)

Cites Work

• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• A linear algorithm for determining the separation of convex polyhedra
• Finding the nearest point in A polytope
• A Subexponential Algorithm for Abstract Optimization Problems
• Unnamed Item

This page was built for publication: Finding the projection on a polytope: An iterative method