Alexander J. Zaslavski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander J. Zaslavski has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Simeon Reich
Department of Mathematics, The Technion-Israel Institute of Technology, Haifa, Israel
48 shared publications - Yair Censor
Department of Mathematics, University of Haifa, Haifa, Israel
6 shared publications - Mohammed Ali Khan
Johns Hopkins University
5 shared publications Simeon Reich
Department of Mathematics, The Technion – Israel Institute of Technology, Haifa, Israel
4 shared publications- Dan Butnariu
Dept. of Mathematics, University of Haifa, 31905 Haifa, Israel
2 shared publications - Daniel Reem
The Technion - Israel Institute of Technology
2 shared publications
Latest Publications
- Open Access
- 31 October 2026
- Published by Springer Nature in Results in Mathematics
- Vol. 81 (8) , 208
The Dynamic String-Averaging Algorithm for Inverse Strongly-Monotone Mappings with Nonsummable Errors
In the work by W. Takahashi and M. Toyoda (2003) it was established the weak convergence of an iteration process of solving a variational inequality problem. This variational inequality is associated with an inverse strongly-monotone mapping. In our recent research we showed that most of exact iterates of the same iterative process are approximate solutions of the variational inequality. In this paper we apply the dynamic string-averaging algorithm in order to find a common solution of a finite family of variational inequality problems, generated by inverse strongly-monotone mappings, and a finite family of fixed point problems for nonexpansive mappings under the presence of nonsummable computational errors. We show that the method generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
- 31 October 2026
- Published by Springer Nature in Results in Mathematics
- Vol. 81 (8) , 208
Open AccessThe Dynamic String-Averaging Algorithm for Inverse Strongly-Monotone Mappings with Nonsummable Errors
In the work by W. Takahashi and M. Toyoda (2003) it was established the weak convergence of an iteration process of solving a variational inequality problem. This variational inequality is associated with an inverse strongly-monotone mapping. In our recent research we showed that most of exact iterates of the same iterative process are approximate solutions of the variational inequality. In this paper we apply the dynamic string-averaging algorithm in order to find a common solution of a finite family of variational inequality problems, generated by inverse strongly-monotone mappings, and a finite family of fixed point problems for nonexpansive mappings under the presence of nonsummable computational errors. We show that the method generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
- Open Access
Variational Inequalities Induced by Set-Valued Mappings
In an infinite-dimensional Hilbert space, we investigate a method for finding a solution of a variational inequality induced by an inverse strongly monotone set-valued mapping. Our results are established in the presence of summable and nonsummable computational errors. We show that our algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
Open AccessVariational Inequalities Induced by Set-Valued Mappings
In an infinite-dimensional Hilbert space, we investigate a method for finding a solution of a variational inequality induced by an inverse strongly monotone set-valued mapping. Our results are established in the presence of summable and nonsummable computational errors. We show that our algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.
- Open Access
The Dynamic String-Averaging Method for Inverse Strongly-Monotone Operators with Summable Errors
In the work by W. Takahashi and M. Toyoda (2003) it was introduced and studied an iterative process for solving a variational inequality problem which is induced by a inverse strongly-monotone mapping. They showed the weak convergence of the iteration process. Recently we established that most of exact iterates of the same iterative process are approximate solutions of the variational inequality. In the present work we use the dynamic string-averaging algorithm for finding a common solution of a finite family of variational inequality problems, generated by inverse strongly-monotone mappings, and a finite family of fixed point problems. We study this algorithm in the presence of summable computational errors. It is shown that the cardinality of the set of iterates which are not approximate solutions is finite and does not exceed a certain constant which is calculated.
Open AccessThe Dynamic String-Averaging Method for Inverse Strongly-Monotone Operators with Summable Errors
In the work by W. Takahashi and M. Toyoda (2003) it was introduced and studied an iterative process for solving a variational inequality problem which is induced by a inverse strongly-monotone mapping. They showed the weak convergence of the iteration process. Recently we established that most of exact iterates of the same iterative process are approximate solutions of the variational inequality. In the present work we use the dynamic string-averaging algorithm for finding a common solution of a finite family of variational inequality problems, generated by inverse strongly-monotone mappings, and a finite family of fixed point problems. We study this algorithm in the presence of summable computational errors. It is shown that the cardinality of the set of iterates which are not approximate solutions is finite and does not exceed a certain constant which is calculated.
- Open Access
- 25 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1838
An Algorithm with Remote Set Control for Inverse Strongly Monotone Mappings
In 2003, W. Takahashi and M. Toyoda established the weak convergence of the iteration process of solving a variational inequality problem. This variational inequality is associated with an inverse strongly monotone mapping. In our recent research, we showed that most of the exact iterates of the same iterative process are approximate solutions of the variational inequality. In this paper, we apply a method with remote set control in order to find a common solution of a family of variational inequality problems, generated by inverse strongly monotone mappings, and a family of fixed point problems, which are not necessarily finite, in the presence of computational errors. Our results are obtained under the presence of summable and nonsummable computational errors.
- 25 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1838
Open AccessAn Algorithm with Remote Set Control for Inverse Strongly Monotone Mappings
In 2003, W. Takahashi and M. Toyoda established the weak convergence of the iteration process of solving a variational inequality problem. This variational inequality is associated with an inverse strongly monotone mapping. In our recent research, we showed that most of the exact iterates of the same iterative process are approximate solutions of the variational inequality. In this paper, we apply a method with remote set control in order to find a common solution of a family of variational inequality problems, generated by inverse strongly monotone mappings, and a family of fixed point problems, which are not necessarily finite, in the presence of computational errors. Our results are obtained under the presence of summable and nonsummable computational errors.
- Open Access
The Cimmino Algorithm for Inverse Strongly-Monotone Mappings
In 2003 W. Takahashi and M. Toyodaestablished the weak convergence of an iteration process to solve a variational inequality problem induced by an inverse strongly-monotone mapping. Recently we proved that for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. It was also shown that the iteration process for solving a variational inequality problem for an inverse strongly-monotone mapping generates approximate solutions in the presence of computational errors. In this work we employ the Cimmino algorithm in order to generalize these results for common approximate solutions of a finite family of variational inequalities with inverse strongly-monotone mappings and of a finite family of fixed point problems in the presence of computational errors.
Open AccessThe Cimmino Algorithm for Inverse Strongly-Monotone Mappings
In 2003 W. Takahashi and M. Toyodaestablished the weak convergence of an iteration process to solve a variational inequality problem induced by an inverse strongly-monotone mapping. Recently we proved that for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. It was also shown that the iteration process for solving a variational inequality problem for an inverse strongly-monotone mapping generates approximate solutions in the presence of computational errors. In this work we employ the Cimmino algorithm in order to generalize these results for common approximate solutions of a finite family of variational inequalities with inverse strongly-monotone mappings and of a finite family of fixed point problems in the presence of computational errors.
- Open Access
- 13 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 664
Solving of a Variational Inequality Problem Under the Presence of Computational Errors
W. Takahashi and M. Toyoda (2003) proved weak convergence of an iteration process of solving a variational inequality problem for an inverse strongly-monotone mapping. In our recent work we showed that, for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. In this paper, we show that the iteration process for solving a variational inequality problem for an inverse strongly monotone mapping generates an approximate solution in the presence of small computational errors. We also estimate a number of iterates needed in order to obtain such an approximate solution.
- 13 February 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (4) , 664
Open AccessSolving of a Variational Inequality Problem Under the Presence of Computational Errors
W. Takahashi and M. Toyoda (2003) proved weak convergence of an iteration process of solving a variational inequality problem for an inverse strongly-monotone mapping. In our recent work we showed that, for the same iterative process, most of its exact iterates are approximate solutions of the variational inequality. In this paper, we show that the iteration process for solving a variational inequality problem for an inverse strongly monotone mapping generates an approximate solution in the presence of small computational errors. We also estimate a number of iterates needed in order to obtain such an approximate solution.
- Open Access
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 1105-1114
Generic Existence and Approximation of Points of Coincidence for Nonlinear Mappings
We study a space of nonlinear self-mappings of a complete metric space which is not necessarily bounded and show that a point of coincidence exists for a generic (typical) map.
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 1105-1114
Open AccessGeneric Existence and Approximation of Points of Coincidence for Nonlinear Mappings
We study a space of nonlinear self-mappings of a complete metric space which is not necessarily bounded and show that a point of coincidence exists for a generic (typical) map.
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 23, 29-50
Multiple turnpikes of linear control systems with nonconvex integrands
In this paper, we study the structure of optimal trajectories of linear control systems with autonomous nonconvex integrands. These control systems possess multiple turnpikes. The description of the structure of approximate optimal solutions is obtained.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Evolution Equations and Control Theory
- Vol. 23, 29-50
Open AccessMultiple turnpikes of linear control systems with nonconvex integrands
In this paper, we study the structure of optimal trajectories of linear control systems with autonomous nonconvex integrands. These control systems possess multiple turnpikes. The description of the structure of approximate optimal solutions is obtained.
- Open Access
Approximate Common Solutions for a Family of Inverse Strongly Monotone Mappings
In 2003 W. Takahashi and M. Toyoda showed the weak convergence of an iteration process of finding the solution of a variational inequality problem for an inverse strongly monotone mapping. In the present paper, we show that for the same process, most of its iterates are approximate common solutions for a finite family of variational inequalities induced by inverse strongly monotone mappings.
Open AccessApproximate Common Solutions for a Family of Inverse Strongly Monotone Mappings
In 2003 W. Takahashi and M. Toyoda showed the weak convergence of an iteration process of finding the solution of a variational inequality problem for an inverse strongly monotone mapping. In the present paper, we show that for the same process, most of its iterates are approximate common solutions for a finite family of variational inequalities induced by inverse strongly monotone mappings.
- 20 October 2025
- Published by Springer Nature
- p. 1-29
Mathematics, Game Theory and Economics: Provisional Observations on David Gale’s 75-Year Career (1949–2024)$^1$- 20 October 2025
- Published by Springer Nature
- p. 1-29
Mathematics, Game Theory and Economics: Provisional Observations on David Gale’s 75-Year Career (1949–2024)$^1$