Solving Discrete Zero Point Problems

In this paper, an algorithm is proposed to find a discrete zero point of a function on the collection of integral points in the n-dimensional Euclidean space R (n). Starting with a given integral point, the algorithm generates a finite 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

MoreLess

Year of publication:	2005
Authors:	van der Laan, Gerard ; Talman, Dolf ; Yang, Zaifu
Publisher:	[S.l.] : SSRN

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (16 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments October 15, 2004 erstellt
Other identifiers:	10.2139/ssrn.610861 [DOI]
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C62 - Existence and Stability Conditions of Equilibrium ; C68 - Computable General Equilibrium Models ; C72 - Noncooperative Games ; c58
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014028761