The minimum error entropy (MEE) criterion is an important learning criterion in information theoretical learning (ITL). However, the MEE solution cannot be obtained in closed form even for a simple linear regression problem, and one has to search it,...
In this paper, a new accelerated fixed point algorithm for solving a common fixed point of a family of nonexpansive operators is introduced and studied, and then a weak convergence result and the convergence behavior of the proposed method is proven...
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...
In this paper we present an algorithm which counts the number of fixed point orbits of an AND-OR dynamical system. We further extend the algorithm in order to list all its fixed point orbits (FPOs) in polynomial time on the number of FPOs of the system.
In 2014, Cui and Wang constructed an algorithm for demicontractive operators and proved some weak convergence theorems of their proposed algorithm to show the existence of solutions for the split common fixed point problem without using the operator...
In this work, an algorithm is introduced for the problem of finding a common fixed point of a finite family of G-nonexpansive mappings in a real Hilbert space endowed with a directed graph G. This algorithm is a modified parallel algorithm inspired b...
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 aim of this paper is to propose an inertial-type AA-viscosity algorithm for approximating the common solutions of the split variational inclusion problem, the generalized equilibrium problem and the common fixed-point problem of nonexpansive mapp...
A new accelerated common fixed point algorithm is introduced and analyzed for a countable family of nonexpansive mappings and then we apply it to solve some convex bilevel optimization problems. Then, under some suitable conditions, we prove a strong...
In this work, we introduce a new inertial accelerated Mann algorithm for finding a point in the set of fixed points of asymptotically nonexpansive mapping in a real uniformly convex Banach space. We also establish weak and strong convergence theorems...
Inertial methods are widely used to accelerate the convergence of iterative algorithms for solving fixed-point problems. However, standard inertial terms often introduce undesirable oscillations, particularly in high-dimensional settings. In this pap...
In this paper, we present a novel variational wavelet inpainting based on the total variation (TV) regularization and the l1-norm fitting term. The goal of this model is to recover incomplete wavelet coefficients in the presence of impulsive noise. B...
In this manuscript, a new three-step iterative scheme to approximate fixed points in the setting of Busemann spaces is introduced. The proposed algorithms unify and extend most of the existing iterative schemes. Thereafter, by making consequent use o...
In the presence of Banach spaces, a novel iterative algorithm is presented in this study using the Chatterjea–Suzuki–C (CSC) condition, and the convergence theorems are established. The efficacy of the proposed algorithm is discussed anal...
The aim of this paper is to formulate and analyze a cyclic iterative algorithm in real Hilbert spaces which converges strongly to a common solution of fixed point problem and multiple-sets split common fixed point problem involving demicontractive op...
In this paper, we introduce a new adaptive double-inertial viscosity algorithm to solve a variational inequality and split common fixed point problem in Hilbert spaces. In our proposed method, we combine two inertial terms with a projected variationa...
For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of con...
In this paper, we propose a viscosity approximation method to solve the split common fixed point problem and consider the bounded perturbation resilience of the proposed method in general Hilbert spaces. Under some mild conditions, we prove that our...
This paper aims to present two inertial iterative algorithms for estimating the solution of split variational inclusion
In this article, we study the JF iterative algorithm to approximate the fixed points of a non-linear operator that satisfies condition (E) in uniformly convex Banach spaces. Further, some weak and strong convergence results are presented for the same...
Two iterative algorithms are suggested for approximating a solution of the split common fixed point problem involved in pseudo-contractive operators without Lipschitz assumption. We prove that the sequence generated by the first algorithm converges w...
Dynamic optimization is an important research topic in chemical process control. A dynamic optimization method with good performance can reduce energy consumption and prompt production efficiency. However, the method of solving the problem is complic...
With the rapid development of advanced driver assistance systems (ADASs) and autonomous driving technology, in-vehicle networks are facing huge challenges in real-time operation and data loss. Traditional vehicle bus network systems such as LIN, CAN,...
In this work, we investigate a minimization problem with a convex objective function on a domain, which is the solution set of a common fixed point problem with a finite family of nonexpansive mappings. Our algorithm is a combination of a projected s...
First of all, in this paper we obtain a perturbed version of the geometric series theorem, which allows us to present an iterative numerical method to approximate the fixed point of a contractive affine operator. This result requires some approximati...
In this paper, a relaxed variable metric primal-dual fixed-point algorithm is proposed for solving the convex optimization problem involving the sum of two convex functions where one is differentiable with the Lipschitz continuous gradient while the...
In this paper, we study a fixed-point problem with a set-valued mapping by using an algorithm based on unions of nonexpansive mappings. We show that an approximate solution is reached after a finite number of iterations in the presence of computation...
In this paper, we propose an alternated inertial projection algorithm for solving multi-valued variational inequality problem and fixed point problem of demi-contractive mapping. On one hand, this algorithm only requires the mapping is pseudo-monoton...
Many authors have proposed fixed-point algorithms for obtaining a fixed point of G-nonexpansive mappings without using inertial techniques. To improve convergence behavior, some accelerated fixed-point methods have been introduced. The main aim of th...
In this paper, a new self-adaptive step size algorithm to approximate the solution of the split minimization problem and the fixed point problem of nonexpansive mappings was constructed, which combined the proximal algorithm and a modified Mann’s ite...
This paper investigates the problem of source localization using signal time-of-arrival (TOA) measurements in the presence of unknown start transmission time. Most state-of-art methods are based on convex relaxation technologies, which possess global...
The Generalized Inner Product SCALing (GIPSCAL) model is a specialized tool for analyzing square asymmetric tables within asymmetric multidimensional scaling (MDS), with applications in sociology (e.g., social mobility tables) and marketing (e.g., br...
A new accelerated algorithm for approximating the common fixed points of a countable family of G-nonexpansive mappings is proposed, and the weak convergence theorem based on our main results is established in the setting of Hilbert spaces with a symm...
In this article, we introduce a new subgradient extra-gradient algorithm to find the common element of a set of fixed points of a Bregman relatively nonexpansive mapping and the solution set of an equilibrium problem involving a Pseudomonotone and Br...
The objective of this research is to present a novel approach to enhance the extragradient algorithm’s efficiency for finding an element within a set of fixed points of nonexpansive mapping and the set of solutions for equilibrium problems. Spe...
This study aims to propose a self-adaptive viscosity-type algorithm with inertial effects to find the common solutions of the split mixed equilibrium, split variational inclusion and common fixed point problems associated with nonexpansive mappings....
This paper introduces and analyzes an inertial projection iterative scheme for solving combined generalized general variational-like inequality problem (CGGVLIP), the zero problem associated with a
Maximum power point tracking (MPPT) is an essential and primary objective in photovoltaic (PV) systems implementation. Thus, in this article, the predictive fixed switching MPPT technique is proposed for a two-stage PV system, where the system under...
This article introduces the concept of proximal enriched contractions for nonself mappings by integrating the enrichment technique of Berinde and Păcurar with the relation-theoretic approach of Alam and Imdad. The existence of best proximity poi...
In this work, four sensor fusion algorithms for inertial measurement unit data to determine the orientation of a device are assessed regarding their usability in a hardware restricted environment such as body-worn sensor nodes. The assessment is done...
In this research paper, we present a new inertial method with a self-adaptive technique for solving the split variational inclusion and fixed point problems in real Hilbert spaces. The algorithm is designed to choose the optimal choice of the inertia...
In the context of uniformly convex Banach space, this paper focuses on examining the strong convergence of the
In this paper, we introduce and study a modified Mann-type algorithm that combines inertial terms for solving common fixed point problems of two countable families of nonexpansive mappings in Hilbert spaces. Under appropriate assumptions on the seque...
In this paper, applying some properties of matrix inequality and Schur complement, we give new upper and lower bounds of the solution for the unified algebraic Lyapunov equation that generalize the forms of discrete and continuous Lyapunov matrix equ...
In this manuscript, we accelerate the modified inertial Mann-like algorithm by involving Tikhonov regularization terms. Strong convergence for fixed points of nonexpansive mappings in real Hilbert spaces was discussed utilizing the proposed algorithm...
Iterative algorithms have been utilized for the computation of approximate solutions of stationary and evolutionary problems associated with differential equations. The aim of this article is to introduce concepts of monotone Reich and Chatterjea non...
In this paper, based on the viscosity approximation method and the hybrid steepest-descent iterative method, a new implicit iterative algorithm is presented for finding the common fixed points set of a finite family of nonexpansive mappings in a refl...
This paper presents the Mann-type inertial accelerated subgradient extragradient algorithm with non-monotonic step sizes for solving the split equilibrium and fixed point problems relating to pseudomonotone and Lipschitz-type continuous bifunctions a...
In the sensorless control algorithm of permanent magnet synchronous motors (PMSMs), there is a significant research focus on developing a high-performance position observer and a cost-effective, high-performance processor specifically designed for PM...
In algorithm development, symmetry plays a vital part in managing optimization problems in scientific models. The aim of this work is to propose a new accelerated method for finding a common point of convex minimization problems and then use the fixe...
of 21