A recursive algorithm for finding the minimum norm point in an unbounded polyhedron

A recursive algorithm for finding the minimum norm point in an unbounded polyhedron

0.00 Avg rating0 Votes
Article ID: iaor19951515
Country: Japan
Volume: 37
Issue: 1
Start Page Number: 1
End Page Number: 11
Publication Date: Mar 1994
Journal: Journal of the Operations Research Society of Japan
Authors: ,
Keywords: programming: convex, programming: geometric
Abstract:

The authors present a recursive algorithm for finding the minimum norm point in an unbounded, convex and pointed polyhedron defined by a finite set of points and rays. The algorithm can start at an arbitrary point of the polyhedron and is not required to solve systems of linear equations.

Reviews

Required fields are marked *. Your email address will not be published.