Simplicial zero-point algorithms: A unifying description (Q1061618)

We consider the limiting paths of simplicial algorithms for finding a zero point. By rewriting the zero-point problem as a problem of finding a stationary point, the problem can be solved by generating a path of stationary points of the function restricted to an expanding convex, compact set. The limiting path of a simplicial algorithm to find a zero point is obtained by choosing this set in an appropriate way. Almost all simplicial algorithms fit in this framework. Using this framework, it can be shown very easily that Merrill's condition is sufficient for convergence of the algorithms.