Aviv Gibali
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
Aviv Gibali has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Oluwatosin Temitope Mewomo
Department of Mathematics, Tarleton State University, Stephenville, USA
8 shared publications - Simeon Reich
Department of Mathematics, The Technion-Israel Institute of Technology, Haifa, Israel
7 shared publications Karl-Heinz Küfer
Optimization Department Fraunhofer ITWM 67663 Kaiserslautern Germany
5 shared publications- Yair Censor
Department of Mathematics, University of Haifa, Haifa, Israel
5 shared publications - Yekini Shehu
School of Mathematical Sciences, Zhejiang Normal University, Jinhua, People’s Republic of China
5 shared publications - Francisco J. Aragón Artacho
Department of Mathematics, University of Alicante, Alicante, Spain
4 shared publications
Latest Publications
- Open Access
- 13 June 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
An S-iteration Tseng splitting method for solving monotone inclusion and fixed point problems with applications
- 13 June 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
Open AccessAn S-iteration Tseng splitting method for solving monotone inclusion and fixed point problems with applications
- Open Access
Nonlinear three-operator splitting algorithms with momentum for monotone inclusions
In this paper, we introduce three novel splitting algorithms for solving structured monotone inclusion problems involving the sum of a maximally monotone operator, a monotone and Lipschitz continuous operator and a cocoercive operator. Each proposed method extends one of the classical schemes: the semi-forward-reflected-backward splitting algorithm, the semi-reflected-forward-backward splitting algorithm, and the outer reflected forward-backward splitting algorithm by incorporating a nonlinear momentum term. Under appropriate step-size conditions, we establish the weak convergence of all three algorithms, and further prove their $R$-linear convergence rates under strong monotonicity assumptions. Preliminary numerical experiments on both synthetic datasets and real-world quadratic programming problems in portfolio optimization demonstrate the effectiveness and superiority of the proposed algorithms.
Open AccessNonlinear three-operator splitting algorithms with momentum for monotone inclusions
In this paper, we introduce three novel splitting algorithms for solving structured monotone inclusion problems involving the sum of a maximally monotone operator, a monotone and Lipschitz continuous operator and a cocoercive operator. Each proposed method extends one of the classical schemes: the semi-forward-reflected-backward splitting algorithm, the semi-reflected-forward-backward splitting algorithm, and the outer reflected forward-backward splitting algorithm by incorporating a nonlinear momentum term. Under appropriate step-size conditions, we establish the weak convergence of all three algorithms, and further prove their $R$-linear convergence rates under strong monotonicity assumptions. Preliminary numerical experiments on both synthetic datasets and real-world quadratic programming problems in portfolio optimization demonstrate the effectiveness and superiority of the proposed algorithms.
- Open Access
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (4) , 7591-7635
Another Meir-Keeler-type nonlinear contractions
This paper deals with the concept of $ \alpha $-$ \hat{v} $-$ A $-$ B $-$ C $-Meir-Keeler type nonlinear contractions, a new class mappings within the of modular extended $ b $-metric spaces. We establish common unique fixed-point theorems that generalize, unify, and extend several key results in modular $ b $-metric and modular extended $ b $-metric spaces. These theorems bridge the gap between classical and contemporary fixed-point theories, showcasing broader applicability in nonlinear analysis. To ensure clarity and practical relevance, a detailed example is presented, further validating the theoretical findings. This work provides some level of understanding of the space under investigation and sets the stage for future developments in this evolving domain.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (4) , 7591-7635
Open AccessAnother Meir-Keeler-type nonlinear contractions
This paper deals with the concept of $ \alpha $-$ \hat{v} $-$ A $-$ B $-$ C $-Meir-Keeler type nonlinear contractions, a new class mappings within the of modular extended $ b $-metric spaces. We establish common unique fixed-point theorems that generalize, unify, and extend several key results in modular $ b $-metric and modular extended $ b $-metric spaces. These theorems bridge the gap between classical and contemporary fixed-point theories, showcasing broader applicability in nonlinear analysis. To ensure clarity and practical relevance, a detailed example is presented, further validating the theoretical findings. This work provides some level of understanding of the space under investigation and sets the stage for future developments in this evolving domain. - 29 October 2024
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 53 (3) , 591-612
A Modified Forward-Backward Splitting Method for Solving Monotone Inclusions and Fixed Points Problems
- 29 October 2024
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 53 (3) , 591-612
A Modified Forward-Backward Splitting Method for Solving Monotone Inclusions and Fixed Points Problems
- Open Access
- 7 August 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (16) , 2453
Multidimensional Evolution Effects on Non-Cooperative Strategic Games
In this study, we examine how the strategies of the players over multiple time scales impact the decision making, resulting payoffs and the costs in non-cooperative strategic games. We propose a dynamic generalized Nash equilibrium problem for non-cooperative strategic games which evolve in multidimensions. We also define an equivalent dynamic quasi-variational inequality problem. The existence of equilibria is established, and a spot electricity market problem is reformulated in terms of the proposed dynamic generalized Nash equilibrium problem. Employing the theory of projected dynamical systems, we illustrate our approach by applying it to a 39-bus network case, which is based on the New England system. Moreover, we illustrate a comparative study between multiple time scales and a single time scale by a simple numerical experiment.
- 7 August 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (16) , 2453
Open AccessMultidimensional Evolution Effects on Non-Cooperative Strategic Games
In this study, we examine how the strategies of the players over multiple time scales impact the decision making, resulting payoffs and the costs in non-cooperative strategic games. We propose a dynamic generalized Nash equilibrium problem for non-cooperative strategic games which evolve in multidimensions. We also define an equivalent dynamic quasi-variational inequality problem. The existence of equilibria is established, and a spot electricity market problem is reformulated in terms of the proposed dynamic generalized Nash equilibrium problem. Employing the theory of projected dynamical systems, we illustrate our approach by applying it to a 39-bus network case, which is based on the New England system. Moreover, we illustrate a comparative study between multiple time scales and a single time scale by a simple numerical experiment.
- Open Access
- 13 July 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (6) , 1-37
A strongly convergent algorithm for solving split equality problems beyond monotonicity
In this paper, we focus on some split inverse problems, namely the split equality variational inequalities and common fixed point problems, and combine various operator theory techniques to establish minimum-norm strong convergence for our proposed method. We present two strong convergent results with (and without) reference to the monotonicity property of the cost operators. Our convergence analyses assume very mild conditions and thus generalize and extend recent related results in the literature. Furthermore, several numerical examples illustrate the practical potentials and advantages of our proposed algorithm.
- 13 July 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (6) , 1-37
Open AccessA strongly convergent algorithm for solving split equality problems beyond monotonicity
In this paper, we focus on some split inverse problems, namely the split equality variational inequalities and common fixed point problems, and combine various operator theory techniques to establish minimum-norm strong convergence for our proposed method. We present two strong convergent results with (and without) reference to the monotonicity property of the cost operators. Our convergence analyses assume very mild conditions and thus generalize and extend recent related results in the literature. Furthermore, several numerical examples illustrate the practical potentials and advantages of our proposed algorithm.
- Open Access
Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption spectroscopy, which is a highly-nonlinear problem with variables coupling, we consider a situation where straightforward translation to a fixed point problem is not possible because the operators that represent the relevant systems of nonlinear equations are not self-mappings, i.e., they operate between spaces of different dimensions. To overcome this difficulty we suggest an "alternating common fixed points algorithm" that acts alternatingly on the different vector variables. This approach translates the original problem to a common fixed point problem for which iterative algorithms are abound and exhibits a viable alternative to translation to an optimization problem, which usually requires derivatives information. However, to apply any of these iterative algorithms requires to ascertain the conditions that appear in their convergence theorems. To circumvent the need to verify conditions for convergence, we propose and motivate a derivative-free algorithm that better suits the tomographic absorption spectroscopy problem at hand and is even further improved by applying to it the superiorization approach. This is presented along with experimental results that demonstrate our approach.
Open AccessApproaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy
In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption spectroscopy, which is a highly-nonlinear problem with variables coupling, we consider a situation where straightforward translation to a fixed point problem is not possible because the operators that represent the relevant systems of nonlinear equations are not self-mappings, i.e., they operate between spaces of different dimensions. To overcome this difficulty we suggest an "alternating common fixed points algorithm" that acts alternatingly on the different vector variables. This approach translates the original problem to a common fixed point problem for which iterative algorithms are abound and exhibits a viable alternative to translation to an optimization problem, which usually requires derivatives information. However, to apply any of these iterative algorithms requires to ascertain the conditions that appear in their convergence theorems. To circumvent the need to verify conditions for convergence, we propose and motivate a derivative-free algorithm that better suits the tomographic absorption spectroscopy problem at hand and is even further improved by applying to it the superiorization approach. This is presented along with experimental results that demonstrate our approach.
- Open Access
- 1 December 2023
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 98 (3) , 461-498
Solving quasimonotone and non-monotone variational inequalities
We present a simple iterative method for solving quasimonotone as well as classical variational inequalities without monotonicity. Strong convergence analysis is given under mild conditions and thus generalize the few existing results that only present weak convergence methods under restrictive assumptions. We give finite and infinite dimensional numerical examples to compare and illustrate the simplicity and computational advantages of the proposed scheme.
- 1 December 2023
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 98 (3) , 461-498
Open AccessSolving quasimonotone and non-monotone variational inequalities
We present a simple iterative method for solving quasimonotone as well as classical variational inequalities without monotonicity. Strong convergence analysis is given under mild conditions and thus generalize the few existing results that only present weak convergence methods under restrictive assumptions. We give finite and infinite dimensional numerical examples to compare and illustrate the simplicity and computational advantages of the proposed scheme.
- Open Access
Superiorized Regularization of Inverse Problems
Inverse problems are characterized by their inherent non-uniqueness and sensitivity with respect to data perturbations. Their stable solution requires the application of regularization methods including variational and iterative regularization methods. Superiorization is a heuristic approach that can steer basic iterative algorithms to have small value of certain regularization functional while keeping the algorithms simplicity and computational efforts, but is able to account for additional prior information. In this note, we combine the superiorization methodology with iterative regularization methods and show that the superiorized version of the scheme yields again a regularization method, however accounting for different prior information.
Open AccessSuperiorized Regularization of Inverse Problems
Inverse problems are characterized by their inherent non-uniqueness and sensitivity with respect to data perturbations. Their stable solution requires the application of regularization methods including variational and iterative regularization methods. Superiorization is a heuristic approach that can steer basic iterative algorithms to have small value of certain regularization functional while keeping the algorithms simplicity and computational efforts, but is able to account for additional prior information. In this note, we combine the superiorization methodology with iterative regularization methods and show that the superiorized version of the scheme yields again a regularization method, however accounting for different prior information.