An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
type: Item
instance of: scholarly article
title: An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
zbMATH Open document ID: 1016.90032
DOI: 10.1016/S0898-1221(00)85008-7
author: R. Smith
publication date: 2001-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 1550659
zbMATH Keywords: projection algorithms
zbMATH Keywords: Euclidean distance
zbMATH Keywords: nonexpansive operators
zbMATH Keywords: convex polyhedra
zbMATH Keywords: local search
zbMATH Keywords: polyhedra
MaRDI profile type: Publication
Wikidata QID: Q59313208
cites work: Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
cites work: Q4038707
cites work: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
cites work: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
cites work: Q4076690
cites work: Q4748596
cites work: Q3706042
cites work: Finding the nearest point in A polytope
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Finding the projection on a polytope: An iterative method
cites work: Solution of projection problems over polytopes
cites work: Q4326787
Recommended article: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
Recommended article: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
Recommended article: An algorithm for solving the nearest point problem in an affine subspace
Recommended article: A new projection method for finding the closest point in the intersection of convex sets
Recommended article: Finding best approximation pairs for two intersections of closed convex sets
Recommended article: An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
Recommended article: An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
Recommended article: Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons
Recommended article: Finding the closest point to the origin in the convex hull of a discrete set of points
Recommended article: On nearest points in closed convex sets
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1550659