Solving discrete zero point problems

DOI10.1007/s10107-005-0696-yzbMath1142.90021OpenAlexW2142363911MaRDI QIDQ2494512

Gerard van der Laan, Zaifu Yang, Adolphus J. J. 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

zbMATH Keywords

triangulationsimplicial algorithmdiscrete zero pointlabeling rule

Mathematics Subject Classification ID

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)

Related Items (13)

On the exceptional zeros of 𝑝-non-ordinary 𝑝-adic 𝐿-functions and a conjecture of Perrin-Riou ⋮ \(p\)-adic heights of generalized Heegner cycles ⋮ Explicit Vologodsky integration for hyperelliptic curves ⋮ A refined Beilinson–Bloch conjecture for motives of modular forms ⋮ A \(p\)-adic arithmetic inner product formula ⋮ Solving discrete systems of nonlinear equations ⋮ Recent Developments in Discrete Convex Analysis ⋮ The Buzzard–Diamond–Jarvis conjecture for unitary groups ⋮ 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 ⋮ On the automorphy of 2-dimensional potentially semistable deformation rings of \(G_{\mathbb{Q}_p}\) ⋮ Explicit Chabauty-Kim for the split Cartan modular curve of level 13

Cites Work

• Unnamed Item
• Unnamed Item
• A constructive proof of Tucker's combinatorial lemma
• The computation of fixed points and applications
• A discrete fixed point theorem and its applications.
• Discrete convexity and unimodularity. I.
• Discrete fixed point theorem reconsidered
• Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• On the existence and approximation of zeroes
• A class of simplicial restart fixed point algorithms without an extra dimension
• A new variable dimension algorithm for the fixed point problem
• A Modified Integer Labeling for Complementarity Algorithms
• Improving the convergence of fixed-point algorithms
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: Solving discrete zero point problems