Solving discrete zero point problems
From MaRDI portal
Publication:2494512
The present paper contributes to the theoretical tools for discrete optimization methods. Namely, the existence of a discrete zero point of a function from an \(n\)-dimensional integer lattice to \(n\)-dimensional Euclidean space is shown. The result is derived by two combinatorial proofs under different boundary conditions, where both proofs are based on simplicial algorithm giving an effective construction method for the generation of the zero point within a finite number of steps.
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
Cites work
- A class of simplicial restart fixed point algorithms without an extra dimension
- A constructive proof of Tucker's combinatorial lemma
- A discrete fixed point theorem and its applications.
- A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
- A Modified Integer Labeling for Complementarity Algorithms
- A new variable dimension algorithm for the fixed point problem
- A restart algorithm for computing fixed points without an extra dimension
- Discrete convexity and unimodularity. I.
- Discrete fixed point theorem reconsidered
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 1395651 (Why is no real title available?)
- Improving the convergence of fixed-point algorithms
- On the existence and approximation of zeroes
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
- Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology
Cited in
(17)- 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
- Recent developments in discrete convex analysis
- \(p\)-adic heights of generalized Heegner cycles
- Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
- 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
- Explicit Vologodsky integration for hyperelliptic curves
- A refined Beilinson–Bloch conjecture for motives of modular forms
- The Buzzard-Diamond-Jarvis conjecture for unitary groups
- A simplical algorithm for computing an integer zero point of a mapping with the direction preserving property
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
- A p-adic arithmetic inner product formula
- Solving discrete systems of nonlinear equations
- Combinatorial integer labeling theorems on finite sets with applications
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)
