Solving discrete zero point problems
DOI10.1007/S10107-005-0696-YzbMATH Open1142.90021OpenAlexW2142363911MaRDI QIDQ2494512FDOQ2494512
Authors: Gerard van der Laan, Zaifu Yang, Dolf Talman 
Publication date: 28 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://papers.tinbergen.nl/04112.pdf
Recommendations
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
- A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS
- Solving discrete systems of nonlinear equations
- Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
- On the solutions of discrete nonlinear complementarity and related problems
Integer programming (90C10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Fixed-point and coincidence theorems (topological aspects) (54H25) General equilibrium theory (91B50)
Cites Work
- Title not available (Why is that?)
- The computation of fixed points and applications
- Title not available (Why is that?)
- The Approximation of Fixed Points of a Continuous Mapping
- A class of simplicial restart fixed point algorithms without an extra dimension
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- A constructive proof of Tucker's combinatorial lemma
- On the existence and approximation of zeroes
- Discrete convexity and unimodularity. I.
- Discrete fixed point theorem reconsidered
- A discrete fixed point theorem and its applications.
- Homotopies for computation of fixed points on unbounded regions
- A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
- A Modified Integer Labeling for Complementarity Algorithms
- Improving the convergence of fixed-point algorithms
- Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
- A new variable dimension algorithm for the fixed point problem
Cited In (17)
- Combinatorial integer labeling theorems on finite sets with applications
- A refined Beilinson–Bloch conjecture for motives of modular forms
- Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
- A simplicial approach for discrete fixed point theorems
- The Buzzard-Diamond-Jarvis conjecture for unitary groups
- Explicit Vologodsky integration for hyperelliptic curves
- Explicit Chabauty-Kim for the split Cartan modular curve of level 13
- A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS
- On the exceptional zeros of \(p\)-non-ordinary \(p\)-adic \(L\)-functions and a conjecture of Perrin-Riou
- A \(p\)-adic arithmetic inner product formula
- \(p\)-adic heights of generalized Heegner cycles
- A simplical algorithm for computing an integer zero point of a mapping with the direction preserving property
- Solving discrete systems of nonlinear equations
- A discrete multivariate mean value theorem with applications
- On the automorphy of 2-dimensional potentially semistable deformation rings of \(G_{\mathbb{Q}_p}\)
- Recent developments in discrete convex analysis
This page was built for publication: Solving discrete zero point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494512)
