Now showing items 1-2 of 2
Exterior point algorithms for nearest points and convex quadratic programs
(Springer-Verlag; The Mathematical Programming Society, Inc., 1992-05)
We consider the problem of finding the nearest point (by Euclidean distance) in a simplicial cone to a given point, and develop an exterior penalty algorithm for it. Each iteration in the algorithm consists of a single ...