Solving discrete systems of nonlinear equations
From MaRDI portal
Publication:635151
DOI10.1016/j.ejor.2011.05.024zbMath1244.90167MaRDI QIDQ635151
Gerard van der Laan, Zaifu Yang, Adolphus J. J. 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
90C10: Integer programming
Related Items
On basic operations related to network induction of discrete convex functions, Projection and convolution operations for integrally convex functions, Existence of positive solutions for a class of nonlinear algebraic systems, Directed discrete midpoint convexity, Scaling, proximity, and optimization of integrally convex functions, Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
Cites Work
- Unnamed Item
- Unnamed Item
- A discrete multivariate mean value theorem with applications
- A constructive proof of Tucker's combinatorial lemma
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Extensions of Lemke's algorithm for the linear complementarity problem
- A discrete fixed point theorem and its applications.
- Some developments in general variational inequalities
- A study on the demand and response correspondences in the presence of indivisibilities
- Discrete fixed point analysis and its applications
- Solving discrete zero point problems
- Submodular functions and optimization.
- Discrete fixed point theorem reconsidered
- A lattice-theoretical fixpoint theorem and its applications
- Variational Inequality Problems with a Continuum of Solutions: Existence and Computation
- On the Solutions of Discrete Nonlinear Complementarity and Related Problems
- 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 Modified Integer Labeling for Complementarity Algorithms
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- Discrete Convex Analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
