On the complexity of detecting positive eigenvectors of nonlinear cone maps

Abstract

In recent work with Lins and Nussbaum, the first author gave an algorithm that can detect the existence of a positive eigenvector for order-preserving homogeneous maps on the standard positive cone. The main goal of this paper is to determine the minimum number of iterations this algorithm requires. It is known that this number is equal to the illumination number of the unit ball $B_v$ of the variation norm, $\parallel x{\parallel }_v:={max}_i{x}_i-{min}_i{x}_i$ on $V_0:=\left\{x\in {ℝ}^n:x_n=0\right\}$. In this paper we show that the illumination number of $B_v$ is equal to $\left(\genfrac{}{}{0ex}{}{n}{\lceil n∕2\rceil }\right)$, and hence provide a sharp lower bound for the running time of the algorithm.