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

arXiv: https://arxiv.org/abs/1605.05351 · HTML: https://mlsanity.com/paper/1605.05351/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 May 2016.

## Built on by (most cited first, 2 of 2)

- [Delaunay-Triangulation-Based Learning with Hessian Total-Variation Regularization](https://mlsanity.com/paper/2208.07787/) (2022)
- [Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope](https://mlsanity.com/paper/2303.11958/) (2023)

## Abstract (arXiv)

This paper is aimed at presenting a systematic survey of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). In the present paper, there are 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 PPOCP. The paper's goal is to draw the attention of a wide range of research at the different formulations of the projection problem, which remain largely unknown due to the fact that the papers (addressing the subject of concern) are published even though on the adjacent, but other topics, or only in the conference proceedings.