Solving Discrete Zero Point Problems

Solving discrete zero point problems

Solving Discrete Zero Point Problems with Vector Labeling

In this paper we present two general results on the existence of a discrete zero point of a function from the n-dimensional integer lattice Z to the n-dimensional Euclidean space IR. Under two different boundary conditions, we give a constructive proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming pivot steps. We also ad...

A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems

In this paper we establish the existence of a discrete zero point of a function from the n-dimensional integer lattice Z to the n-dimensional Euclidean space IR under very general conditions with respect to the behaviour of the function. The proof is constructive and uses a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear programming pivot ste...

A strong convergence theorem for solutions of zero point problems and fixed point problems

Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces‎.

a strong convergence theorem for solutions of zero point problems and fixed point problems

zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated‎. ‎a strong convergence theorem for the common solutions of the problems is established in the framework of hilbert spaces‎.