Minimum distance between the faces of two convex polyhedra: A sufficient condition

DOI10.1023/A:1024755315702zbMath1033.90089DBLPjournals/jgo/LlanasSF03OpenAlexW1600958875WikidataQ59313199 ScholiaQ59313199MaRDI QIDQ1404394

D. Massart

Publication date: 21 August 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024755315702

zbMATH Keywords

Projection algorithmsDistance between convex polyhedraLocal descentSufficient condition of global minimum

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (2)

A local search algorithm for ray-convex polyhedron intersection ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering

This page was built for publication: Minimum distance between the faces of two convex polyhedra: A sufficient condition