Dattorro Convex Optimization of Eternity II
From Wikimization
(Difference between revisions)
| Line 1: | Line 1: | ||
| - | This [http://www.convexoptimization.com/TOOLS/Wotao.Yin/EternityII.mat Matlab binary] contains matrices <math>\,E</math> and <math>\, | + | This [http://www.convexoptimization.com/TOOLS/Wotao.Yin/EternityII.mat Matlab binary] contains matrices |
| + | *<math>\,\tilde{E}\!\in\!\mathbb{R}^{10054\times204304}</math> and <math>\,\tilde{\tau}\in\!\mathbb{R}^{10054}</math> | ||
I regard the following as a very difficult problem, having spent considerable time with it. | I regard the following as a very difficult problem, having spent considerable time with it. | ||
| Line 5: | Line 6: | ||
<center> | <center> | ||
<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= | + | \mbox{subject to}&\tilde{E}\,x=\tilde{\tau}\\ |
&x\succeq_{}\mathbf{0}\end{array}</math> | &x\succeq_{}\mathbf{0}\end{array}</math> | ||
</center> | </center> | ||
| - | Matrix <math>E\!\in\!\mathbb{R}^{10054\times204304}</math> is sparse having only 1,170,516 nonzeros. | + | Matrix <math>\tilde{E}\!\in\!\mathbb{R}^{10054\times204304}</math> is sparse having only 1,170,516 nonzeros. |
| - | All entries of <math>E\,</math> are integers from the set <math>\{{-1},0,1\}\,</math>. | + | All entries of <math>\tilde{E}\,</math> are integers from the set <math>\{{-1},0,1\}\,</math>. |
| - | <math> | + | <math>\tilde{\tau}\in\{0,1\}^{10054}</math>. |
Vector <math>c\,</math> is left unspecified because it is varied later as part of a | Vector <math>c\,</math> is left unspecified because it is varied later as part of a | ||
Revision as of 19:58, 13 February 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
.