Pages that link to "Item:Q842297"
From MaRDI portal
The following pages link to An algorithm for solving the nearest point problem in an affine subspace (Q842297):
Displaying 8 items.
- An active index algorithm for the nearest point problem in a polyhedral cone (Q548684) (← links)
- Finding the orthogonal projection of a point onto an affine subspace (Q874996) (← links)
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm (Q1799963) (← links)
- (Q4502618) (← links)
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones (Q4698235) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)