Projection on Polyhedral Cone

From Wikimization

(Difference between revisions)
Jump to: navigation, search
(New page: 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 p...)
Line 1: Line 1:
-
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 an intersection of halfspaces.
+
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.
This problem has many practical and theoretical applications.
-
Its solution is certainly worth a Ph.D. thesis.
+
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.
You are welcome and encouraged to write your thoughts about this problem here.

Revision as of 21:43, 8 June 2008

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.

Personal tools