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.
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.
31 March 2025 in Fundamental Journal of Mathematics and Applications
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.