Search Results (138)

This research focuses on developing a novel approach to finding fixed points of quasi-nonexpansive mappings without relying on the demi-closedness condition, a common requirement in previous studies. The approach is based on the Subgradient Extragradient technique, which builds upon the foundational extragradient method introduced by G.M. Korpelevich. Korpelevich’s method is a widely recognized tool in the fields of optimization and variational inequalities. This study extends Korpelevich’s technique by adapting it to a broader class of operators while maintaining critical convergence properties. This research demonstrates the effectiveness and practical applicability of this new method through detailed computational examples, highlighting its potential to address complex mathematical problems across various domains. Full article

This work presents an extragradient-type iterative process combined with the viscosity method to find a common solution to a split generalized variational-like inequality, a variational inequality, and a fixed point problem associated with a family of $\epsilon$-strict pseudo-contractive mappings and a nonexpansive operator in Hilbert spaces. Strong convergence of the proposed algorithm is established, with some remarks derived from the main theorem. Numerical experiments are carried out to verify the applicability of the method and provide comparative observations. The results broaden and unify a range of existing contributions in this field. Full article

To tackle the inefficiencies in 3D mine tunnel modeling and the tedious task of drawing centerlines, this study introduces a faster method for generating centerlines using CAD secondary development. Starting with the tunnel centerline, the research then dives into techniques for creating detailed 3D tunnel models. The team first broke down the steps and logic behind tunnel modeling, designing a 3D tunnel framework and its data structure—complete with key geometric components like traverse points, junctions, nodes, and centerlines. By refining older centerline drawing techniques, they built a CAD-powered tool that slashes time and effort. The study also harnessed advanced algorithms, such as surface fitting and curve lofting, to swiftly model tricky tunnel sections like curves and crossings. This method fixes common problems like warped or incomplete surfaces in linked tunnel models, delivering precise and lifelike 3D scenes for VR-based mining safety drills and simulations. Full article

Herein, we present two hybrid inertial self-adaptive iterative methods for determining the combined solution of the split variational inclusions and fixed-point problems. Our methods include viscosity approximation, fixed-point iteration, and inertial extrapolation in the initial step of each iteration. We employ two self-adaptive step sizes to compute the iterative sequence, which do not require the pre-calculated norm of a bounded linear operator. We prove strong convergence theorems to approximate the common solution of the split variational inclusions and fixed-point problems. Further, we implement our methods and results to examine split variational inequality and split common fixed-point problems. Finally, we illustrate our methods and compare them with some known methods existing in the literature. Full article

This study numerically explores the dynamics of the photogravitational circular restricted three-body problem, where an infinitesimal particle moves under the gravitational influence of two primary bodies connected by a massless rod. These primary masses revolve in circular orbits around their common center of mass, which remains fixed at the origin of the coordinate system. The distance between the two masses remains constant, independent of their rotation period. The third body, being infinitesimally small compared to the primary masses, has a negligible effect on their motion. The primary mass is considered as a radiating body, while the secondary is modeled as an elongated one comprising two hypothetical point masses separated by a fixed distance. The analysis focuses on determining the number, location, and stability of equilibrium points, as well as examining the structure of zero-velocity curves under the influence of system parameters such as mass and force ratio, radiation pressure and geometric configuration of the secondary body. The system is found to allow up to six equilibria: four collinear and two non-collinear. Their number and positions are significantly affected by variations in the system’s parameters. Stability analysis reveals that the two non-collinear equilibrium points can exhibit stability under specific parameter configurations, while the four collinear points are typically unstable. An exception is the innermost collinear equilibrium point, which can be stable for certain parameter values. Our numerical investigation on periodic orbits around the collinear equilibrium points of the asteroid triple-system 2001SN₂₆₃ show that a variation, either to the values of radiation or the force ratio parameters, influence their special characteristics such as period and stability. Also, their continuation in the space of initial conditions shows that all families terminate naturally at collision orbits with either the primary or the secondary. Full article

In this article, we define a new class of noncommuting self mappings known as the S-operator pair. Also, we provide the existence and uniqueness of common fixed point results involving the S-operator pair satisfying the $(F,\phi ,\psi ,Z)$-contractive condition in m-metric spaces, which unifies and generalizes most of the existing relevant fixed point theorems. Furthermore, the variables in the m-metric space are symmetric, which is significant for solving nonlinear problems in operator theory. In addition, examples are provided in order to illustrate the concepts and results presented herein. It has been demonstrated that the results can be applied to prove the existence of a solution to a system of integral equations, a nonlinear fractional differential equation and an ordinary differential equation for damped forced oscillations. Also, in the end, the satellite web coupling problem is solved. Full article

In this paper, we introduce a triple Mann iteration method for approximating an element in the set of common solutions of a system of quasivariational inclusion issues, which is an equilibrium problem and a common fixed point problem (CFPP) of finitely many quasi-nonexpansive operators on a Hadamard manifold. Through some suitable assumptions, we prove that the sequence constructed in the suggested algorithm is convergent to an element in the set of common solutions. Finally, making use of the main result, we deal with the minimizing problem with a CFPP constraint and saddle point problem with a CFPP constraint on a Hadamard manifold, respectively. Full article

In this paper, we introduce a modified form of the G-variational inequality problem, called the combination of G-variational inequalities problem, within a Hilbert space structured by graphs. Furthermore, we develop an iterative scheme to find a common element between the set of fixed points of a G-nonexpansive mapping and the solution set of the proposed G-variational inequality problem. Under appropriate assumptions, we establish a strong convergence theorem within the framework of a Hilbert space endowed with graphs. Additionally, we present the concept of the G-minimization problem, which diverges from the conventional minimization problem. Applying our main results, we demonstrate a strong convergence theorem for the G-minimization problem. Finally, we provide illustrative examples to validate and support our theoretical findings. Full article

The primary objective of this article is to enhance the convergence rate of the extragradient method through the careful selection of inertial parameters and the design of a self-adaptive stepsize scheme. We propose an improved version of the extragradient method for approximating a common solution to pseudomonotone equilibrium and fixed-point problems that involve an infinite family of demimetric mappings in real Hilbert spaces. We establish that the iterative sequences generated by our proposed algorithms converge strongly under suitable conditions. These results substantiate the effectiveness of our approach in achieving convergence, marking a significant advancement in the extragradient method. Furthermore, we present several numerical tests to illustrate the practical efficiency of the proposed method, comparing these results with those from established methods to demonstrate the improved convergence rates and solution accuracy achieved through our approach. Full article

In this research article, we introduce a novel iterative approach that builds upon a two-step extragradient-viscosity method. This method aims to find a common element among the solution set of a variational inequality, an equilibrium problem, and the set of common fixed points from a countable family of demicontractive mappings in a Hilbert space. We offer a robust convergence theorem for the proposed iterative scheme, considering certain well-conditioned parameters. Our findings represent an improvement over similar results already available in the existing literature. Furthermore, we demonstrate the applicability of our main result to W-mappings. Lastly, we present two numerical examples to exhibit the consistency and accuracy of our devised scheme. Full article

In this paper, we propose and study an averaged Halpern-type algorithm for approximating the solution of a common fixed-point problem for a couple of nonexpansive and demicontractive mappings with a variational inequality constraint in the setting of a Hilbert space. The strong convergence of the sequence generated by the algorithm is established under feasible assumptions on the parameters involved. In particular, we also obtain the common solution of the fixed point problem for nonexpansive or demicontractive mappings and of a variational inequality problem. Our results extend and generalize various important related results in the literature that were established for two pairs of mappings: (nonexpansive, nonspreading) and (nonexpansive, strongly quasi-nonexpansive). Numerical tests to illustrate the superiority of our algorithm over the ones existing in the literature are also reported. Full article

This paper introduces a novel parallel method for solving common variational inclusion and common fixed-point (CVI-CFP) problems. The proposed algorithm provides a strong convergence theorem established under specific conditions associated with the CVI-CFP problem. Numerical simulations demonstrate the algorithm’s efficacy in the context of signal recovery problems involving various types of blurred filters. The results highlight the algorithm’s potential for practical applications in image processing and other fields. Full article

This paper deals with the problem of finding a common solution for a fixed point problem for strictly pseudocontractive mappings and for a certain variational inequality problem. We propose a projection-type implicit averaged algorithm and establish the strong convergence of the sequences generated by this method to the common solution for the fixed point problem and the variational inequality problem. In order to illustrate the feasibility of the hypotheses and the superiority of our theoretical results over the existing literature, an example is also presented. Full article

Convex bilevel optimization problems (CBOPs) exhibit a vital impact on the decision-making process under the hierarchical setting when image restoration plays a key role in signal processing and computer vision. In this paper, a modified double inertial extragradient-like approach with a line search procedure is introduced to tackle the CBOP with constraints of the CFPP and VIP, where the CFPP and VIP represent a common fixed point problem and a variational inequality problem, respectively. The strong convergence analysis of the proposed algorithm is discussed under certain mild assumptions, where it constitutes both sections that possess a mutual symmetry structure to a certain extent. As an application, our proposed algorithm is exploited for treating the image restoration problem, i.e., the LASSO problem with the constraints of fractional programming and fixed-point problems. The illustrative instance highlights the specific advantages and potential infect of the our proposed algorithm over the existing algorithms in the literature, particularly in the domain of image restoration. Full article

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed-point problems) with quasi-pseudocontractive mappings in real Hilbert spaces, with special cases being able to be found in many important engineering practical applications, such as image recognizing, signal processing, and machine learning. In order to solve HVIPs of potential application value, inspired by the primal-dual algorithm, we propose a novel accelerated cyclic iterative algorithm that combines the inertial method with a correction term and a self-adaptive step-size technique. Our approach eliminates the need for prior knowledge of the bounded linear operator norm. Under appropriate assumptions, we establish strong convergence of the algorithm. Finally, we apply our novel iterative approximation to solve multiple-set split feasibility problems and verify the effectiveness of the proposed iterative algorithm through numerical results. Full article