Solving discrete systems of nonlinear equations

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
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
Finite-Dimensional Variational Inequalities and Complementarity Problems
Submodular functions and optimization.
A lattice-theoretical fixpoint theorem and its applications
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 (9)

Projection and convolution operations for integrally convex functions
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
Constructing exact solutions to discrete systems with the trial function method
On basic operations related to network induction of discrete convex functions
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)