Finding the projection on a polytope: An iterative method
From MaRDI portal
Publication:1352784
DOI10.1016/0898-1221(96)00164-2zbMath0869.90087MaRDI QIDQ1352784
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
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C99: Mathematical programming
Related Items
An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\), Efficient computation of the Hausdorff distance between polytopes by exterior random covering, Hausdorff matching and Lipschitz optimization
Cites Work