Dattorro Convex Optimization of Eternity II
From Wikimization
(Difference between revisions)
Line 6: | Line 6: | ||
<math>\begin{array}{cl}\mbox{minimize}_x&c^{\rm T}x\\ | <math>\begin{array}{cl}\mbox{minimize}_x&c^{\rm T}x\\ | ||
\mbox{subject to}&E\,x=t\\ | \mbox{subject to}&E\,x=t\\ | ||
- | &x\ | + | &x\succeq_{}\mathbf{0}\end{array}</math> |
</center> | </center> | ||
Revision as of 18:53, 31 January 2011
This Matlab binary contains matrices and .
I regard the following as a very difficult problem, having spent considerable time with it.
Matrix is sparse having only 1,170,516 nonzeros.
All entries of are integers from the set .
.
Vector is left unspecified because it is varied later as part of a Convex Iteration.
Vector may arbitrarily be set to or .