Müzeyyen Ertürk
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
Müzeyyen Ertürk has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Vatan Karakaya
Yildiz Technical University
16 shared publications - Faik Gürsoy
Department of Mathematics, Adiyaman University, Adiyaman, Türkiye
14 shared publications - Emirhan Hacıoğlu
Department of Mathematics, Trakya University, 22030 Edirne, Türkiye
5 shared publications Faik Gürsoy
Department of Mathematics, Adiyaman University, Adiyaman, Turkey
5 shared publications- Gradimir V. Milovanovic
Serbian Academy of Sciences and Arts, Belgrade, Serbia
4 shared publications Abdul Rahim Khan
Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals
3 shared publications
Latest Publications
- 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
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
- 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.
- 8 January 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (8) , 1957-1978
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- 8 January 2023
- Published by Springer Nature in Optimization Letters
- Vol. 17 (8) , 1957-1978
Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
- 15 October 2021
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 89 (2) , 1-28
An Efficient Inertial Type Iterative Algorithm to Approximate the Solutions of Quasi Variational Inequalities in Real Hilbert Spaces
- 15 October 2021
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 89 (2) , 1-28
An Efficient Inertial Type Iterative Algorithm to Approximate the Solutions of Quasi Variational Inequalities in Real Hilbert Spaces
- 2 January 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (1) , 29-44
A New Gradient Projection Algorithm for Convex Minimization Problem and its Application to Split Feasibility Problem
- 2 January 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 50 (1) , 29-44
A New Gradient Projection Algorithm for Convex Minimization Problem and its Application to Split Feasibility Problem
- 4 May 2020
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 98 (3) , 435-448
S-iterative algorithm for solving variational inequalities
In this paper we propose iterative algorithm for finding the common element of the set of solutions of the variational inequalities and the set of fixed points of nonexpansive mappings. We study the convergence criteria of the mentioned algorithm under some mild conditions. As an application, a modified algorithm is suggested to solve convex minimization problems. Numerical examples are given to validate the theoretical findings obtained herein. Our results may be considered as an improvement, refinement and complement of the previously known results.- 4 May 2020
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 98 (3) , 435-448
S-iterative algorithm for solving variational inequalities
In this paper we propose iterative algorithm for finding the common element of the set of solutions of the variational inequalities and the set of fixed points of nonexpansive mappings. We study the convergence criteria of the mentioned algorithm under some mild conditions. As an application, a modified algorithm is suggested to solve convex minimization problems. Numerical examples are given to validate the theoretical findings obtained herein. Our results may be considered as an improvement, refinement and complement of the previously known results.- 28 May 2019
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 41 (2) , 192-208
Coincidences of Nonself Operators by a Simpler Algorithm
In this article, we introduce a new class of contractive mappings and study analytical and computational aspects of a special case of Jungck-Khan iterative algorithm generated by this class of mappings. In particular, we improve upon strong convergence, rate of convergence and data dependence results existing in the current literature. Analytical as well numerical illustrative examples are given to support the new results.
- 28 May 2019
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 41 (2) , 192-208
Coincidences of Nonself Operators by a Simpler Algorithm
In this article, we introduce a new class of contractive mappings and study analytical and computational aspects of a special case of Jungck-Khan iterative algorithm generated by this class of mappings. In particular, we improve upon strong convergence, rate of convergence and data dependence results existing in the current literature. Analytical as well numerical illustrative examples are given to support the new results.
- 27 April 2019
- Published by Springer Nature in Numerical Algorithms
- Vol. 83 (3) , 867-883
A Picard-type iterative algorithm for general variational inequalities and nonexpansive mappings
- 27 April 2019
- Published by Springer Nature in Numerical Algorithms
- Vol. 83 (3) , 867-883
A Picard-type iterative algorithm for general variational inequalities and nonexpansive mappings