# Projection on Polyhedral Cone

(Difference between revisions)
 Revision as of 13:26, 9 June 2008 (edit)← Previous diff Revision as of 01:04, 27 February 2009 (edit) (undo)Next diff → Line 3: Line 3: We simply want a ''formula'' for projecting a given point in Euclidean space on a cone described by the intersection of an arbitrary number of halfspaces;
we want the closest point in the polyhedral cone. We simply want a ''formula'' for projecting a given point in Euclidean space on a cone described by the intersection of an arbitrary number of halfspaces;
we want the closest point in the polyhedral cone. - By "formula" I mean a closed form; an equation or set of equations (not a program or optimization).
+ By "formula" I mean a closed form; an equation or set of equations (not a program, algorithm, or optimization).
A set of formulae, the choice of which is conditional, is OK A set of formulae, the choice of which is conditional, is OK as long as size of the set is not factorial (prohibitively large). as long as size of the set is not factorial (prohibitively large).

## Revision as of 01:04, 27 February 2009

This is an open problem in Convex Optimization. At first glance, it seems rather simple; the problem is certainly easily understood:

We simply want a formula for projecting a given point in Euclidean space on a cone described by the intersection of an arbitrary number of halfspaces;
we want the closest point in the polyhedral cone.

By "formula" I mean a closed form; an equation or set of equations (not a program, algorithm, or optimization).
A set of formulae, the choice of which is conditional, is OK as long as size of the set is not factorial (prohibitively large).

This problem has many practical and theoretical applications. Its solution is certainly worth a Ph.D. thesis in any Math or Engineering Department.