File talk:Cvx diag.png

A few suggestions for the diagram:

Any convex optimization problem can be expressed as a conic optimization, so that the two classes are equivalent.

In particular, geometric programming can also be expressed in a conic way.

Finally, SOCPs can also be expressed as special SDPs, and LPs as special QCQPs. 86.39.61.47 09:04, 14 April 2007 (UTC)[reply]