A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
type: Item
instance of: scholarly article
title: A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
zbMATH Open document ID: 0791.90046
DOI: 10.1007/BF01582149
author: Kazuyuki Sekitani
author: Yoshitsugu Yamamoto
published in: Mathematical Programming. Series A. Series B
publication date: 1994-03-27T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 513280
zbMATH Keywords: convex quadratic program
zbMATH Keywords: minimum Euclidean norm point
zbMATH Keywords: minimum Euclidean distance pair of points
zbMATH Keywords: recursive algorithm
zbMATH Keywords: simplicial decomposition
MaRDI profile type: Publication
cites work: A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
cites work: Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
cites work: A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
cites work: A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
cites work: Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
cites work: Error bounds for monotone linear complementarity problems
cites work: Finding the nearest point in A polytope
full work available at URL: https://doi.org/10.1007/bf01582149
OpenAlex ID: W2094911742
description: scientific article; zbMATH DE number 513280