A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES

DOI10.15807/jorsj.35.353zbMath0778.90062OpenAlexW261959637MaRDI QIDQ5288735

Satoru Fujishige, Ping Zhan

Publication date: 17 August 1993

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.35.353

zbMATH Keywords

polytopesnearest pair of pointsseparating-hyperplane algorithm

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Continuous location (90B85) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane ⋮ Zonotopes and the LP-Newton method ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ A simple projection algorithm for linear programming problems ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) ⋮ A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

This page was built for publication: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES