Pages that link to "Item:Q1352784"

The following pages link to Finding the projection on a polytope: An iterative method (Q1352784):

Displaying 8 items.

• An algorithm for solving the nearest point problem in an affine subspace (Q842297) (← links)
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
• Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
• Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
• A Simultaneous Iterative Method for Computing Projections on Polyhedra (Q3758566) (← links)
• Fast projection method for a special class of polytopes with applications (Q3815151) (← links)
• A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$ (Q4345415) (← links)