A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094): Difference between revisions

It is well-known that the efficiency of simplicial fixed point algorithms crucially depends on the underlying triangulations. In this paper, the authors propose a modification of \textit{A. H. Wright}'s \(2^{n}\)-ray algorithm [Math. Program. 21, 47-69 (1981; Zbl 0475.65029)]. It is shown that this modification is better than any other available triangulation for the \(2^{n}\)-ray algorithm.