Emirhan Hacıoğlu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Emirhan Hacıoğlu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Faik Gürsoy
Department of Mathematics, Adiyaman University, Adiyaman, Türkiye
8 shared publications - Gradimir V. Milovanovic
Serbian Academy of Sciences and Arts, Belgrade, Serbia
5 shared publications - Müzeyyen Ertürk
Department of Mathematics, Adiyaman University, 2040 Adiyaman, Türkiye
5 shared publications - Kadri Doğan
Artvin Çoruh Üniversitesi
2 shared publications - Vatan Karakaya
Yildiz Technical University
2 shared publications - Abdul Rahim Khan
Department of Mathematics and Statistics, Institute of Southern Punjab, Multan, Pakistan
1 shared publication
Latest Publications
- Open Access
- 24 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1433
A Novel Inertial-Type Iteration Algorithm: Convergence, Data Dependence, and Applications in Image Deblurring and Fractal Generation
This study introduces a novel inertial-type iteration algorithm based on the Normal S iteration for the class of almost contraction mappings in Banach spaces. Traditional fixed point iterations often suffer from slow convergence and high computational cost; to address these limitations, the proposed framework incorporates an adaptive inertial-type parameter. We establish strong convergence of the algorithm and derive explicit a posteriori error estimates under weak contractive conditions. In addition, we demonstrate the asymptotic equivalence of the NS inertial-type trajectories with the classical Normal S iteration, provide a comprehensive weak —stability analysis, and obtain sharp upper bounds for the data dependence problem. The practical performance of the algorithm is evaluated in two distinct computational domains: image deblurring via wavelet-based regularization and the generation of complex fractal patterns, including Julia and Mandelbrot sets. Numerical results show that the proposed inertial-type iteration algorithm significantly outperforms existing methods—such as Picard, Mann, Ishikawa, and standard Normal S iterations—achieving faster convergence, higher PSNR values in image restoration, and more stable basins of attraction in fractal visualizations. These findings highlight the effectiveness and versatility of the NS inertial-type iteration algorithm approach for both theoretical analysis and real-world applications.- 24 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1433
Open AccessA Novel Inertial-Type Iteration Algorithm: Convergence, Data Dependence, and Applications in Image Deblurring and Fractal Generation
This study introduces a novel inertial-type iteration algorithm based on the Normal S iteration for the class of almost contraction mappings in Banach spaces. Traditional fixed point iterations often suffer from slow convergence and high computational cost; to address these limitations, the proposed framework incorporates an adaptive inertial-type parameter. We establish strong convergence of the algorithm and derive explicit a posteriori error estimates under weak contractive conditions. In addition, we demonstrate the asymptotic equivalence of the NS inertial-type trajectories with the classical Normal S iteration, provide a comprehensive weak —stability analysis, and obtain sharp upper bounds for the data dependence problem. The practical performance of the algorithm is evaluated in two distinct computational domains: image deblurring via wavelet-based regularization and the generation of complex fractal patterns, including Julia and Mandelbrot sets. Numerical results show that the proposed inertial-type iteration algorithm significantly outperforms existing methods—such as Picard, Mann, Ishikawa, and standard Normal S iterations—achieving faster convergence, higher PSNR values in image restoration, and more stable basins of attraction in fractal visualizations. These findings highlight the effectiveness and versatility of the NS inertial-type iteration algorithm approach for both theoretical analysis and real-world applications. - Open Access
Convergence-Equivalent DF and AR Iterations with Refined Data Dependence: Non-Asymptotic Error Bounds and Robustness in Fixed-Point Computations
Recent developments in fixed-point theory have focused on iterative techniques for approximating solutions, yet there remain important questions about whether different methods are equivalent and how well they resist perturbations. In this study, two recently proposed algorithms, referred to as the DF and AR iteration methods, are shown to be connected by proving that they converge similarly when applied to contraction mappings in Banach spaces, provided that their control sequences meet specific, explicit conditions. This work extends previous research on data dependence by removing restrictive assumptions related to both the perturbed operator and the algorithmic parameters, thereby increasing the range of situations where the results are applicable. Utilizing a non-asymptotic analysis, the authors derive improved error bounds for fixed-point deviations under operator perturbations, achieving a tightening of these estimates by a factor of 3–15 compared to earlier results. A key contribution of this study is the demonstration that small approximation errors lead only to proportionally small deviations from equilibrium, which is formalized in bounds of the form . These theoretical findings are validated through applications involving integral equations and examples from function spaces. Overall, this work unifies the convergence analysis of different iterative methods, enhances guarantees regarding stability, and provides practical tools for robust computational methods in areas such as optimization, differential equations, and machine learning. By relaxing structural constraints and offering a detailed sensitivity analysis, this study significantly advances the design and understanding of iterative algorithms in applied mathematics.Open AccessConvergence-Equivalent DF and AR Iterations with Refined Data Dependence: Non-Asymptotic Error Bounds and Robustness in Fixed-Point Computations
Recent developments in fixed-point theory have focused on iterative techniques for approximating solutions, yet there remain important questions about whether different methods are equivalent and how well they resist perturbations. In this study, two recently proposed algorithms, referred to as the DF and AR iteration methods, are shown to be connected by proving that they converge similarly when applied to contraction mappings in Banach spaces, provided that their control sequences meet specific, explicit conditions. This work extends previous research on data dependence by removing restrictive assumptions related to both the perturbed operator and the algorithmic parameters, thereby increasing the range of situations where the results are applicable. Utilizing a non-asymptotic analysis, the authors derive improved error bounds for fixed-point deviations under operator perturbations, achieving a tightening of these estimates by a factor of 3–15 compared to earlier results. A key contribution of this study is the demonstration that small approximation errors lead only to proportionally small deviations from equilibrium, which is formalized in bounds of the form . These theoretical findings are validated through applications involving integral equations and examples from function spaces. Overall, this work unifies the convergence analysis of different iterative methods, enhances guarantees regarding stability, and provides practical tools for robust computational methods in areas such as optimization, differential equations, and machine learning. By relaxing structural constraints and offering a detailed sensitivity analysis, this study significantly advances the design and understanding of iterative algorithms in applied mathematics. - 19 August 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (2) , 361-378
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application
- 19 August 2025
- Published by Springer Nature in Optimization Letters
- Vol. 20 (2) , 361-378
A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application
- Open Access
Generalizations of Certain Classes of Single-Valued Mappings to Multivalued Cases
In this study, multivalued generalizations of certain classes of single-valued transformations defined on metric spaces are obtained. Building upon recently introduced concepts such as mappings contracting perimeters of triangles, new structural properties and fixed-point results for the multivalued counterparts are explored.
Open AccessGeneralizations of Certain Classes of Single-Valued Mappings to Multivalued Cases
In this study, multivalued generalizations of certain classes of single-valued transformations defined on metric spaces are obtained. Building upon recently introduced concepts such as mappings contracting perimeters of triangles, new structural properties and fixed-point results for the multivalued counterparts are explored.
- Open Access
Flexible and Efficient Iterative Solutions for General Variational Inequalities in Real Hilbert Spaces
This paper introduces a novel Picard-type iterative algorithm for solving general variational inequalities in real Hilbert spaces. The proposed algorithm enhances both the theoretical framework and practical applicability of iterative algorithms by relaxing restrictive conditions on parametric sequences, thereby expanding their scope of use. We establish convergence results, including a convergence equivalence with a previous algorithm, highlighting the theoretical relationship while demonstrating the increased flexibility and efficiency of the new approach. The paper also addresses gaps in the existing literature by offering new theoretical insights into the transformations associated with variational inequalities and the continuity of their solutions, thus paving the way for future research. The theoretical advancements are complemented by practical applications, such as the adaptation of the algorithm to convex optimization problems and its use in real-world contexts like machine learning. Numerical experiments confirm the proposed algorithm’s versatility and efficiency, showing superior performance and faster convergence compared to an existing method.
Open AccessFlexible and Efficient Iterative Solutions for General Variational Inequalities in Real Hilbert Spaces
This paper introduces a novel Picard-type iterative algorithm for solving general variational inequalities in real Hilbert spaces. The proposed algorithm enhances both the theoretical framework and practical applicability of iterative algorithms by relaxing restrictive conditions on parametric sequences, thereby expanding their scope of use. We establish convergence results, including a convergence equivalence with a previous algorithm, highlighting the theoretical relationship while demonstrating the increased flexibility and efficiency of the new approach. The paper also addresses gaps in the existing literature by offering new theoretical insights into the transformations associated with variational inequalities and the continuity of their solutions, thus paving the way for future research. The theoretical advancements are complemented by practical applications, such as the adaptation of the algorithm to convex optimization problems and its use in real-world contexts like machine learning. Numerical experiments confirm the proposed algorithm’s versatility and efficiency, showing superior performance and faster convergence compared to an existing method.
- Open Access
- 31 March 2025
- Published by Fundamental Journal of Mathematics and Applications in Fundamental Journal of Mathematics and Applications
- Vol. 8 (1) , 19-30
A Study on Fourth-Order Coupled Boundary Value Problems: Existence, Uniqueness and Approximations
This study examines the existence and approximation of solutions for a coupled system of fourth-order boundary value problems (4th-BVPs), which model the interactions between two distinct but interrelated physical systems. These coupled boundary value problems arise in various applications in engineering and physics, including the analysis of bending behaviors in beams and vibrations in interconnected structural components. By leveraging Green`s functions and building upon prior research in fourth-order differential equations, we derive sufficient conditions for the existence and uniqueness of solutions to the system. Additionally, we provide a numerical framework for approximating these solutions, offering practical insights for real-world applications.
- 31 March 2025
- Published by Fundamental Journal of Mathematics and Applications in Fundamental Journal of Mathematics and Applications
- Vol. 8 (1) , 19-30
Open AccessA Study on Fourth-Order Coupled Boundary Value Problems: Existence, Uniqueness and Approximations
This study examines the existence and approximation of solutions for a coupled system of fourth-order boundary value problems (4th-BVPs), which model the interactions between two distinct but interrelated physical systems. These coupled boundary value problems arise in various applications in engineering and physics, including the analysis of bending behaviors in beams and vibrations in interconnected structural components. By leveraging Green`s functions and building upon prior research in fourth-order differential equations, we derive sufficient conditions for the existence and uniqueness of solutions to the system. Additionally, we provide a numerical framework for approximating these solutions, offering practical insights for real-world applications.
- Open Access
- 7 August 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 869-890
Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification
In this paper, we introduce two novel forward-backward splitting algorithms (FBSAs) for nonsmooth convex minimization. We provide a thorough convergence analysis, emphasizing the new algorithms and contrasting them with existing ones. Our findings are validated through a numerical example. The practical utility of these algorithms in real-world applications, including machine learning for tasks such as classification, regression, and image deblurring reveal that these algorithms consistently approach optimal solutions with fewer iterations, highlighting their efficiency in real-world scenarios.
- 7 August 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 869-890
Open AccessNovel algorithms based on forward-backward splitting technique: effective methods for regression and classification
In this paper, we introduce two novel forward-backward splitting algorithms (FBSAs) for nonsmooth convex minimization. We provide a thorough convergence analysis, emphasizing the new algorithms and contrasting them with existing ones. Our findings are validated through a numerical example. The practical utility of these algorithms in real-world applications, including machine learning for tasks such as classification, regression, and image deblurring reveal that these algorithms consistently approach optimal solutions with fewer iterations, highlighting their efficiency in real-world scenarios.
- 25 November 2023
- Published by Springer Nature in Ukrainian Mathematical Journal
- Vol. 75 (7) , 1108-1127
Monotone Generalized α-Nonexpansive Mappings on CATp(0) Spaces
- 25 November 2023
- Published by Springer Nature in Ukrainian Mathematical Journal
- Vol. 75 (7) , 1108-1127
Monotone Generalized α-Nonexpansive Mappings on CATp(0) Spaces
- 5 May 2022
- Published by Springer Nature in Results in Mathematics
- Vol. 77 (3) , 1-24
Variational Inequality Problem Involving Multivalued Nonexpansive Mapping in CAT(0) Spaces
- 5 May 2022
- Published by Springer Nature in Results in Mathematics
- Vol. 77 (3) , 1-24
Variational Inequality Problem Involving Multivalued Nonexpansive Mapping in CAT(0) Spaces
- 23 October 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 40 (8) , 1-25
A comparative study on iterative algorithms of almost contractions in the context of convergence, stability and data dependency
- 23 October 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 40 (8) , 1-25
A comparative study on iterative algorithms of almost contractions in the context of convergence, stability and data dependency