Pages that link to "Item:Q1591950"
From MaRDI portal
The following pages link to An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950):
Displaying 14 items.
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Clipping algorithms for solving the nearest point problem over reduced convex hulls (Q621999) (← links)
- Representation complexity of adaptive 3D distance fields (Q632926) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes (Q1315417) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Kernel projection algorithm for large-scale SVM problems. (Q1850682) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty (Q2462584) (← links)
- Convex Minimization on a Grid and Applications (Q4386447) (← links)
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735) (← links)
