Dattorro Convex Optimization of Eternity II

(Difference between revisions)

Revision as of 00:12, 31 January 2011

This Matlab binary contains matrices $LaTeX: \,E$ and $LaTeX: \,t$ .

I regard the following as a very difficult problem, having spent considerable time with it.

$LaTeX: \begin{array}{cl}\mbox{minimize}_{x\in\{0,1\}}&c^{\rm T}x\\ \mbox{subject to}&E\,x=t\\ &x\geq_{}\mathbf{0}\end{array}$

Matrix $LaTeX: E\!\in\!\mathbb{R}^{10054\times204304}$ is sparse having only 1,170,516 nonzeros.

All its entries are integers from the set $LaTeX: \{{-1},0,1\}\,$ .

Vector $LaTeX: c\,$ is left unspecified because it is varied later as part of a Convex Iteration.

Vector $LaTeX: c\,$ may arbitrarily be set to $LaTeX: \mathbf{0}$ or $LaTeX: \mathbf{1}$ .

@@ Line 1: / Line 1: @@
-The [http://www.convexoptimization.com/TOOLS/Wotao.Yin/EternityII.mat Matlab binary] contains matrices <math>\,E</math> and <math>\,t</math>.
+This [http://www.convexoptimization.com/TOOLS/Wotao.Yin/EternityII.mat Matlab binary] contains matrices <math>\,E</math> and <math>\,t</math>.
 I regard the following as a very difficult problem, having spent considerable time with it.
@@ Line 11: / Line 11: @@
 Matrix <math>E\!\in\!\mathbb{R}^{10054\times204304}</math> is sparse having only 1,170,516 nonzeros.
-All its entries are integers from the set <math>\{{-1},0,1\}</math>.&nbsp;
+All its entries are integers from the set <math>\{{-1},0,1\}\,</math>.&nbsp;
 Vector <math>c\,</math> is left unspecified because it is varied later as part of a