A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE

DOI10.15807/jorsj.33.188zbMath0712.90055MaRDI QIDQ3197625

Satoru Fujishige, Ping Zhan

Publication date: 1990

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.33.188

zbMATH Keywords

dual algorithm; separating hyperplane; minimum-norm point; Wolfe's primal algorithm

Mathematics Subject Classification ID

90C25: Convex programming

90C20: Quadratic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Error bounds for solutions of linear equations and inequalities, Zonotopes and the LP-Newton method, An approximate algorithm for computing multidimensional convex hulls, An interior point algorithm for large scale portfolio optimization, A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes, An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane, An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested