Shub–Smale's optimal-start-pair conjecture

Let V={(h,z)S×P(Cn+1)h(z)=0}V=\{(h,z)\in{\mathbb S}\times{\mathbb P}({\mathbb C}^{n+1})\mid h(z)=0\} be the solution variety, and let (g,e0)(g,e_0) be the initial pair with

g={d1X0d11X1dnX0dn1Xn,e0=(100).g=\begin{cases}\sqrt{d_1}X_0^{d_1-1}X_1\\ \vdots\\ \sqrt{d_n}X_0^{d_n-1}X_n\end{cases},\qquad e_0=\begin{pmatrix}1\\0\\ \vdots\\0\end{pmatrix}.

For an initial pair (g,z0)V(g,z_0)\in V, write C0(f,g,z0)\mathcal{C}_0(f,g,z_0) for the homotopy-path length. Shub–Smale's optimal-start-pair conjecture. The initial pair (g,e0)(g,e_0) as described above minimizes E(C0(f,g,z0)){\rm E}(\mathcal{C}_0(f,g,z_0)) over all initial pairs (g,z0)(g,z_0) in the solution variety VV. This stronger conjecture is motivated by the paper's computational experiments, which found no initial pair outperforming (g,e0)(g,e_0) in the tested cases; the general minimization claim remains open in the supplied source.

Sources & referencesView supporting material

Primary source

Anton Leykin, “A search for an optimal start system for numerical homotopy continuation”, arXiv:1105.4324 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.