  This paper is devoted to the general problem of projection onto a polyhedral
convex cone generated by a finite set of generators.This problem is
reformulated into projection onto the polytope obtained by simple truncation of
the original cone. Then it can be solved with just two closely related
projections onto the same bounded polytope. This approach's computational
performance is conditioned by the crucial tool's efficiency for solving the
fundamental problem of finding the least norm element in a convex hull of a
given finite set of points. In our numerical experiments, we used for this
purpose the specialized finite algorithm implemented in the open-source system
for matrix-vector calculations octave. This algorithm is practically
indifferent to the proportions between the number of generators and their
dimensionality and significantly outperformed a general-purpose quadratic
programming algorithm of the active-set variety built into octave when the
number of points exceeds the dimensionality of the original problem.
