Loading...
Solving discrete zero point problems
van der Laan,G. Talman,A.J.J. Yang,Z.F.
van der Laan,G.
Talman,A.J.J.
Yang,Z.F.
Abstract
In this paper an algorithm is proposed to .nd a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space IRn.Starting with a given integral point, the algorithm generates a .nite sequence of adjacent integral simplices of varying dimension and terminates with, under certain convergency conditions, a vertex, which yields a discrete zero point of the function under consideration.
Description
Pagination: 15
Date
2004
Journal Title
Journal ISSN
Volume Title
Publisher
Operations research
Files
Research Projects
Organizational Units
Journal Issue
Keywords
discrete zero point, discrete fixed point, simplicial algorithm, triangulation
Citation
van der Laan, G, Talman, A J J & Yang, Z F 2004 'Solving discrete zero point problems' CentER Discussion Paper, vol. 2004-113, Operations research, Tilburg.