Pages that link to "Item:Q5288735"
From MaRDI portal
The following pages link to A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735):
Displayed 7 items.
- Zonotopes and the LP-Newton method (Q833464) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950) (← links)
- A simple projection algorithm for linear programming problems (Q1755785) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)