Minimization of the Hausdorff distance between convex polyhedrons

DOI10.1007/s10958-005-0043-0zbMath1090.90122OpenAlexW2065645278MaRDI QIDQ2487445

A. S. Lakhtin, V. N. Ushakov

Publication date: 5 August 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-005-0043-0

zbMATH Keywords

nonsmooth analysislocationiterative subgradient methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

Optimization of the Hausdorff distance between sets in Euclidean space, Unnamed Item

Cites Work

• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item