Narrow search
Showing 1 - 10 of 677,397
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
Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009
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
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2009
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
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
Combinatorial integer labeling theorems on finite sets with an application to discrete systems of nonlinear equations
Laan, Gerard van der; 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...
Persistent link: https://www.econbiz.de/10011373836
Cover Image
Combinatorial Integer Labeling Thorems on Finite Sets With an Application to Discrete Systems of Nonlinear Equations
van der Laan, Gerard - 2008
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} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10012726145
Cover Image
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2009
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
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...
Persistent link: https://www.econbiz.de/10014222902
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
Solving discrete zero point problems with vector labeling
Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2005
proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear … programming pivot steps. We also adept the algorithm to prove the existence of a solution to the discrete complementarity problem. …
Persistent link: https://www.econbiz.de/10011346458