# Dattorro Convex Optimization of Eternity II

### From Wikimization

Line 4: | Line 4: | ||

*<math>\tau\!\in\!\mathbb{R}^{11077}</math> and <math>\,E\!\in\!\mathbb{R}^{11077\times262144}</math> is the million column Eternity II matrix having redundant rows and columns removed analytically, | *<math>\tau\!\in\!\mathbb{R}^{11077}</math> and <math>\,E\!\in\!\mathbb{R}^{11077\times262144}</math> is the million column Eternity II matrix having redundant rows and columns removed analytically, | ||

*<math>\tilde{\tau}\!\in\!\mathbb{R}^{10054}</math> and <math>\,\tilde{E}\!\in\!\mathbb{R}^{10054\times204304}</math> has columns removed corresponding to some known zero variables (removal produced dependent rows), | *<math>\tilde{\tau}\!\in\!\mathbb{R}^{10054}</math> and <math>\,\tilde{E}\!\in\!\mathbb{R}^{10054\times204304}</math> has columns removed corresponding to some known zero variables (removal produced dependent rows), | ||

- | *<math>b\!\in\!\mathbb{R}^{7362}</math> and <math>A\!\in\!\mathbb{R}^{7362\times150638}</math> has columns removed not in smallest face (containing <math>\tilde{\tau}</math>) of polyhedral cone <math>\mathcal{K} | + | *<math>b\!\in\!\mathbb{R}^{7362}</math> and <math>A\!\in\!\mathbb{R}^{7362\times150638}</math> has columns removed not in smallest face (containing <math>\tilde{\tau}</math>) of polyhedral cone <math>\mathcal{K}=\{\tilde{E}^{}x~|~x\!\succeq\!0\}</math>. |

The following linear program is a very difficult problem that remains unsolved: | The following linear program is a very difficult problem that remains unsolved: | ||

Line 19: | Line 19: | ||

Direction vector <math>z\,</math> is determined by [[Convex Iteration]]: | Direction vector <math>z\,</math> is determined by [[Convex Iteration]]: | ||

<center> | <center> | ||

- | <math>\begin{array}{rl}\mbox{maximize}_z&z^{\rm T\!}x^ | + | <math>\begin{array}{rl}\mbox{maximize}_z&z^{\rm T\!}x^*\\ |

\mbox{subject to}&0\preceq z\preceq\mathbf{1}\\ | \mbox{subject to}&0\preceq z\preceq\mathbf{1}\\ | ||

&z^{\rm T}\mathbf{1}=256 | &z^{\rm T}\mathbf{1}=256 | ||

Line 28: | Line 28: | ||

The Eternity II puzzle is solved when | The Eternity II puzzle is solved when | ||

<center><math> | <center><math> | ||

- | z^{ | + | z^{*\rm T\!}x^*=_{}256 |

</math></center> | </math></center> | ||

Minimal cardinality of this Eternity II problem is equal to number of puzzle pieces, 256. | Minimal cardinality of this Eternity II problem is equal to number of puzzle pieces, 256. | ||

- | Comment: The technique, convex iteration, requires no modification (and works very well) when applied instead to mixed integer programming (MIP, not discussed in book). There is no modification to the linear program statement here except 256 variables, corresponding to the largest entries of iterate <math>x^ | + | Comment: The technique, convex iteration, requires no modification (and works very well) when applied instead to mixed integer programming (MIP, not discussed in book). There is no modification to the linear program statement here except 256 variables, corresponding to the largest entries of iterate <math>x^*</math>, are declared binary. |

## Revision as of 12:56, 24 November 2011

An Eternity II puzzle problem formulation is discussed thoroughly in section 4.6.0.0.15 of the book Convex Optimization & Euclidean Distance Geometry which is freely available. That matrix is obtained by presolving a sparse 864,593 1,048,576 system. This Matlab binary contains three successive reductions, each equivalent to that larger system:

- and is the million column Eternity II matrix having redundant rows and columns removed analytically,
- and has columns removed corresponding to some known zero variables (removal produced dependent rows),
- and has columns removed not in smallest face (containing ) of polyhedral cone .

The following linear program is a very difficult problem that remains unsolved:

Matrix is sparse having only 782,087 nonzeros. All entries of are integers from the set .

Vector has only 358 nonzeros.

Direction vector is determined by Convex Iteration:

These two problems are iterated to find a minimal cardinality solution . Constraint bounds the variable from above by . Any minimal cardinality solution is binary and solves the Eternity II puzzle. The Eternity II puzzle is solved when

Minimal cardinality of this Eternity II problem is equal to number of puzzle pieces, 256.

Comment: The technique, convex iteration, requires no modification (and works very well) when applied instead to mixed integer programming (MIP, not discussed in book). There is no modification to the linear program statement here except 256 variables, corresponding to the largest entries of iterate , are declared binary.