An iterative algorithm for finding a nearest pair of points in two convex subsets of R^n

DOI10.1016/S0898-1221(00)85008-7MaRDI QIDQ1591950zbMATH OpenWikidataFDO

Authors R. Smith

Publication date 14 January 2001

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(00)85008-7

zbMATH Keywords

convex polyhedraEuclidean distancelocal searchnonexpansive operatorspolyhedraprojection algorithms

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Convex programming (90C25)

Recommendations

• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• An algorithm for solving the nearest point problem in an affine subspace
• A new projection method for finding the closest point in the intersection of convex sets
• Finding best approximation pairs for two intersections of closed convex sets
• An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
• An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
• Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons
• Finding the closest point to the origin in the convex hull of a discrete set of points
• On nearest points in closed convex sets

Cites work

• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• Finding the nearest point in A polytope
• Finding the projection on a polytope: An iterative method
• scientific article; zbMATH DE number 3933857 (Why is no real title available?)
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 3493803 (Why is no real title available?)
• scientific article; zbMATH DE number 736664 (Why is no real title available?)
• scientific article; zbMATH DE number 3806227 (Why is no real title available?)
• On Projection Algorithms for Solving Convex Feasibility Problems
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
• Solution of projection problems over polytopes

Cited in

(15)

• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• Finding a best approximation pair of points for two polyhedra
• Efficient computation of the Hausdorff distance between polytopes by exterior random covering
• Kernel projection algorithm for large-scale SVM problems.
• Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
• Hausdorff matching and Lipschitz optimization
• A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
• scientific article; zbMATH DE number 4043137 (Why is no real title available?)
• A local search algorithm for ray-convex polyhedron intersection
• scientific article; zbMATH DE number 730000 (Why is no real title available?)
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• Uniform tree approximation by global optimization techniques
• Clipping algorithms for solving the nearest point problem over reduced convex hulls
• Representation complexity of adaptive 3D distance fields
• The nearest point problem in a polyhedral set and its extensions

This page was built for publication: An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591950)