The Problem of Projecting the Origin of Euclidean Space onto the Convex Polyhedron

Abstract

This paper is aimed at presenting a systematic exposition of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). We have concentrated on the convex polyhedron given as a convex hull of finitely many vectors of the space. We investigated the reduction of the projection program to the problems of quadratic programming, maximin, linear complementarity, and nonnegative least squares. Such reduction justifies the opportunity of utilizing a much more broad spectrum of powerful tools of mathematical programming for solving the PPOCP. The paper’s goal is to draw the attention of a wide range of research at the different formulations of the projection problem.