Solving discrete systems of nonlinear equations

DOI10.1016/J.EJOR.2011.05.024zbMATH Open1244.90167OpenAlexW3124688973MaRDI QIDQ635151FDOQ635151

Authors: Gerard van der Laan, Zaifu Yang, Dolf Talman 

Publication date: 19 August 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://papers.tinbergen.nl/09062.pdf

Recommendations

• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• Solving discrete zero point problems
• Application of a discrete fixed point theorem to the Cournot model
• A discrete fixed point theorem and its applications.
• Discrete fixed point analysis and its applications

zbMATH Keywords

triangulationfixed pointzero pointsimplicial algorithmdiscrete system of equations

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Discrete Convex Analysis
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Some developments in general variational inequalities
• Discrete fixed point analysis and its applications
• Title not available (Why is that?)
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Submodular functions and optimization.
• A lattice-theoretical fixpoint theorem and its 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
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• A constructive proof of Tucker's combinatorial lemma
• Solving discrete zero point problems
• On the existence and approximation of zeroes
• Discrete fixed point theorem reconsidered
• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• On the solutions of discrete nonlinear complementarity and related problems
• A discrete fixed point theorem and its applications.
• Extensions of Lemke's algorithm for the linear complementarity problem
• Variational inequality problems with a continuum of solutions: Existence and computation
• A discrete multivariate mean value theorem with applications
• A study on the demand and response correspondences in the presence of indivisibilities
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• A Modified Integer Labeling for Complementarity Algorithms

Cited In (14)

• Projection and convolution operations for integrally convex functions
• Solving discrete zero point problems
• A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
• Title not available (Why is that?)
• Scaling, proximity, and optimization of integrally convex functions
• Directed discrete midpoint convexity
• Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
• Recent progress on integrally convex functions
• A simplical algorithm for computing an integer zero point of a mapping with the direction preserving property
• Constructing exact solutions to discrete systems with the trial function method
• On basic operations related to network induction of discrete convex functions
• Application of a discrete fixed point theorem to the Cournot model
• A discrete multivariate mean value theorem with applications
• Existence of positive solutions for a class of nonlinear algebraic systems

This page was built for publication: Solving discrete systems of nonlinear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635151)