Narrow search
Showing 1 - 10 of 41,518
Cover Image
Computing integral solutions of complementarity problems
Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2004
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …
Persistent link: https://www.econbiz.de/10011343323
Cover Image
Solving discrete systems of nonlinear equations
Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10011378347
Cover Image
Computing Integral Solutions of Complementarity Problems
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2005
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …
Persistent link: https://www.econbiz.de/10014028508
Cover Image
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2009
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10010325776
Cover Image
Solving discrete systems of nonlinear equations
Laan, Gerard van der (contributor); Talman, Dolf (contributor) - 2008
Persistent link: https://www.econbiz.de/10003807167
Cover Image
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard - 2008
of the triangulation lies in an n-dimensional cube of size one. With respect to this triangulation we assume that the … zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of …
Persistent link: https://www.econbiz.de/10012722331
Cover Image
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2009
the triangulation lies in a cube of size one. With respect to this triangulation we assume that the function satisfies … prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10014206228
Cover Image
Solving Discrete Zero Point Problems
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2004
AbstractSee document.
Persistent link: https://www.econbiz.de/10010325312
Cover Image
Solving discrete zero point problems
Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2004
Persistent link: https://www.econbiz.de/10011337990
Cover Image
Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2007
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit … cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1 …,-2,....-n} with the property that antipodal vertices on the boundary of the cube are assigned opposite labels, the triangulation …
Persistent link: https://www.econbiz.de/10010325373