A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems

DOI10.1137/050646378zbMath1137.90013OpenAlexW2019325857MaRDI QIDQ5444292

Zaifu Yang, Gerard van der Laan, Adolphus J. J. Talman

Publication date: 25 February 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/ws/files/847313/dzpvlty08.pdf

zbMATH Keywords

integer latticezero pointsimplicial algorithmdiscrete complementarityvector labeling rule

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) General equilibrium theory (91B50) Fixed points and coincidences in algebraic topology (55M20)

Related Items (5)

Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope ⋮ Solving discrete systems of nonlinear equations ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ A discrete multivariate mean value theorem with applications ⋮ A simplicial approach for discrete fixed point theorems

This page was built for publication: A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems