Projection on Polyhedral Cone
From Wikimization
Revision as of 21:43, 8 June 2008 by 66.92.48.168 (Talk)
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.
This problem has many practical and theoretical applications. Its solution is certainly worth a Ph.D. thesis in any Math or Engineering Department.
You are welcome and encouraged to write your thoughts about this problem here.