Search

In this work, we establish the closedness and convexity of the set of fixed points of equally continuous and asymptotically demicontractive mapping in the intermediate sense. We proposed an inertial hybrid projection technique for determining an approximate common solution to three significant problems. The first is the system of generalized mixed equilibrium problems with relaxed η−ζ$$ \eta -\zeta $$ monotone mappings, the second is the problem of fixed points of a countable family of equally continuous and asymptotically demicontractive mappings in the intermediate sense, and the third is of determining a point in a null space of a countable family of inverse strongly monotone mappings in Hilbert space. Based on these problems, we formulate a theorem and establish its strong convergence to their common solution. Additionally, we studied the applications of our algorithm to variational inequality problems and convex optimization problems. Finally, we numerically demonstrate the efficiency and robustness of our scheme. Several results available in the literature can be obtained as special cases of our result. [ABSTRACT FROM AUTHOR]

Several conjugate gradient (CG) parameters resulted in promising methods for optimization problems. However, it turns out that some of these parameters, for example, 'PRP,' 'HS,' and 'DL,' do not guarantee sufficient descent of the search direction. In this work, we introduce new spectral-like CG methods that achieve sufficient descent property independently of any line search (LSE) and for arbitrary nonnegative CG parameters. We establish the global convergence of these methods for four different parameters using Wolfe LSE. Our algorithm achieves this without regular restart and assumption of convexity regarding the objective functions. The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. We conduct computational experiments to showcase the implementation and effectiveness of the proposed methods. The proposed spectral-like methods, namely nonnegative SPRP, SHZ, SDL, and SHS, exhibit superior performance based on their arrangement, outperforming HZ and SP methods in terms of the number of iterations, function evaluations, and gradient evaluations. [ABSTRACT FROM AUTHOR]

In this work, two inertial algorithms for approximating common elements of the sets of solutions of three important problems are constructed. The first problem is a generalized mixed equilibrium one involving relaxed monotone mapping, the second is a zero problem of inverse strongly monotone mappings, while the third one is a fixed point problem of a family of relatively nonexpansive mappings. The first algorithm is a shrinking projection type for a common solution of all the three problems. The second is a generalized Alber projection free method for the second and the third problems. Each of the devised algorithms uses the conjugate gradient-like direction, which allows it to accelerate its iterates toward a solution of the problems. The strong convergence theorem for each of the algorithms is formulated and proved in a real 2 - uniformly convex and uniformly smooth Banach space. Additionally, the applications of our algorithms to convex optimization problems and image recovery problems are studied. The advantages and computational efficiency of our methods are analyzed based on their numerical performance in comparison to some of the existing and recently proposed methods using numerical example. [ABSTRACT FROM AUTHOR]

This paper provides convergence analysis of some variants of the hybrid extragradient algorithm (HEA) in Hilbert spaces. We employ the HEA to compute the common solution of the equilibrium problem and split fixed-point problem associated with the finite families of k -demicontractive mappings. We also incorporate appropriate numerical results concerning the viability of the proposed variants with respect to various real-world applications. [ABSTRACT FROM AUTHOR]

In this paper, we prove strong convergence theorem of the general inertial Mann–Halpern algorithm for nonexpansive mappings in the setting of Hilbert spaces. We also prove weak convergence theorem of the general inertial Mann algorithm for k-strict pseudo-contractive mappings in the setting of Hilbert spaces. These convergence results extend and generalize some existing results in the literature. Finally, we provide examples to verify our main results. [ABSTRACT FROM AUTHOR]

This work presents a new three-term projection algorithm for solving nonlinear monotone equations. The paper is aimed at constructing an efficient and competitive algorithm for finding approximate solutions of nonlinear monotone equations. This is based on a new choice of the conjugate gradient direction which satisfies the sufficient descent condition. The convergence of the algorithm is shown under Lipschitz continuity and monotonicity of the involved operator. Numerical experiments presented in the paper show that the algorithm needs a less number of iterations in comparison with existing algorithms. Furthermore, the proposed algorithm is applied to solve signal recovery problems. [ABSTRACT FROM AUTHOR]

In this paper, a Halpern–Tseng-type algorithm for approximating zeros of the sum of two monotone operators whose zeros are J-fixed points of relatively J-nonexpansive mappings is introduced and studied. A strong convergence theorem is established in Banach spaces that are uniformly smooth and 2-uniformly convex. Furthermore, applications of the theorem to convex minimization and image-restoration problems are presented. In addition, the proposed algorithm is used in solving some classical image-recovery problems and a numerical example in a Banach space is presented to support the main theorem. Finally, the performance of the proposed algorithm is compared with that of some existing algorithms in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the split feasibility problem with multiple output sets in Hilbert spaces. For solving the aforementioned problem, we propose two new self-adaptive relaxed CQ algorithms which involve computing of projections onto half-spaces instead of computing onto the closed convex sets, and it does not require calculating the operator norm. We establish a weak and a strong convergence theorems for the proposed algorithms. We apply the new results to solve some other problems. Finally, we present some numerical examples to show the efficiency and accuracy of our algorithm compared to some existing results. Our results extend and improve some existing methods in the literature. [ABSTRACT FROM AUTHOR]

In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization problem over the fixed point set of a finite family of multivalued demicontractive mappings. We also provide numerical results concerning the viability of the proposed algorithm with possible applications. [ABSTRACT FROM AUTHOR]

In this paper, relaxed and relaxed inertial modified Tseng algorithms for approximating zeros of sum of two monotone operators whose zeros are fixed points or J-fixed points of some nonexpansive-type mappings are introduced and studied. Strong convergence theorems are proved in the setting of real Banach spaces that are uniformly smooth and 2-uniformly convex. Furthermore, applications of the theorems to the concept of J-fixed point, convex minimization, image restoration and signal recovery problems are also presented. In addition, some interesting numerical implementations of our proposed methods in solving image recovery and compressed sensing problems are presented. Finally, the performance of our proposed methods are compared with that of some existing methods in the literature. [ABSTRACT FROM AUTHOR]

The multiple-sets split feasibility problem (MSSFP) requires finding a point closet to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. Motivated by the ball-relaxed projection algorithm proposed by Yu et al. for the split feasibility problem (SFP), in this paper, we introduce ball-relaxed projection algorithms for solving the MSSFP. Instead of the level sets or half-spaces, our algorithms require computing the orthogonal projections onto closed balls. We establish weak and strong convergence of the proposed algorithms to a solution of the MSSFP. Finally, we provide preliminary numerical experiments to show the efficiency and the implementation of our method. [ABSTRACT FROM AUTHOR]

This study presents two inertial type extragradient algorithms for finding a common solution to the monotone variational inequalities and fixed point problems for ρ$$ \rho $$‐demicontractive mapping in real Hilbert spaces. We provide inertial type iterative algorithms with self‐adaptive variable step size rules that do not require prior knowledge of the operator value. Our algorithms employ a basic step size rule, which is derived by certain computations at each iteration. Without previous knowledge of the operators Lipschitz constant, two strong convergence theorems were obtained. Finally, we present a number of numerical experiments to evaluate the efficacy and applicability of the proposed algorithms. The conclusions of this study on variational inequality and fixed point problems support and extend previous findings. [ABSTRACT FROM AUTHOR]

We propose structured spectral gradient algorithms for solving nonlinear least squares problems based on a modified structured secant equation. The idea was to integrate more details of the Hessian of the objective function into the standardized spectral parameters with the goal of improving numerical efficiency. We safeguard the structured spectral parameters to avoid negative curvature search direction. The sequence of the search direction generated by the respective proposed algorithm satisfies the sufficient descent condition. Using a nonmonotone line search strategy, we establish the global convergence of the proposed algorithms under some standard assumptions. Numerical experiments on some benchmark test problems show that the proposed algorithms are efficient and outperform some existing competitors. [ABSTRACT FROM AUTHOR]

In this paper, we introduce two new self-adaptive iterative algorithms for finding the solution of a split variational inclusion problem in real Hilbert spaces. The strong convergence theorems are proved under suitable conditions. In applications, the main results are applied for solving the split feasibility problem, the split minimization problem, and the split common fixed point problem. In order to test the numerical performances, the proposed algorithms are compared with several existing algorithms in the literature. Finally, the computational experiments show that the proposed algorithms are fast and more efficient than other approaches. [ABSTRACT FROM AUTHOR]

In recent times, various algorithms have been incorporated with the inertial extrapolation step to speed up the convergence of the sequence generated by these algorithms. As far as we know, very few results exist regarding algorithms of the inertial derivative-free projection method for solving convex constrained monotone nonlinear equations. In this article, the convergence analysis of a derivative-free iterative algorithm (Liu and Feng in Numer. Algorithms 82(1):245–262, 2019) with an inertial extrapolation step for solving large scale convex constrained monotone nonlinear equations is studied. The proposed method generates a sufficient descent direction at each iteration. Under some mild assumptions, the global convergence of the sequence generated by the proposed method is established. Furthermore, some experimental results are presented to support the theoretical analysis of the proposed method. [ABSTRACT FROM AUTHOR]

He (J. Inequal. Appl. 2012:Article ID 162 2012) introduced the proximal point CQ algorithm (PPCQ) for solving the split equilibrium problem (SEP). However, the PPCQ converges weakly to a solution of the SEP and is restricted to monotone bifunctions. In addition, the step-size used in the PPCQ is a fixed constant μ in the interval (0 , 1 ∥ A ∥ 2) . This often leads to excessive numerical computation in each iteration, which may affect the applicability of the PPCQ. In order to overcome these intrinsic drawbacks, we propose a robust step-size { μ n } n = 1 ∞ which does not require computation of ∥ A ∥ and apply the adaptive step-size rule on { μ n } n = 1 ∞ in such a way that it adjusts itself in accordance with the movement of associated components of the algorithm in each iteration. Then, we introduce a self-adaptive extragradient-CQ algorithm (SECQ) for solving the SEP and prove that our proposed SECQ converges strongly to a solution of the SEP with more general pseudomonotone equilibrium bifunctions. Finally, we present a preliminary numerical test to demonstrate that our SECQ outperforms the PPCQ. [ABSTRACT FROM AUTHOR]

This paper provides iterative construction of a common solution associated with the classes of equilibrium problems (EP) and split convex feasibility problems. In particular, we are interested in the EP defined with respect to the pseudomonotone bifunction, the fixed point problem (FPP) for a finite family of -demicontractive operators, and the split null point problem. From the numerical standpoint, combining various classical iterative algorithms to study two or more abstract problems is a fascinating field of research. We, therefore, propose an iterative algorithm that combines the parallel hybrid extragradient algorithm with the inertial extrapolation technique. The analysis of the proposed algorithm comprises theoretical results concerning strong convergence under a suitable set of constraints and numerical results. [ABSTRACT FROM AUTHOR]

This paper presents equilibrium problems and their regularized problems in the framework of Hadamard spaces. Using the concept of tangent space products, we introduce a resolvent operator and deduce essential properties in relation to equilibrium problem. Furthermore, we analyze the regularized problems involving resolvent operators. Finally, we establish two convergence results concerning proximal algorithms. [ABSTRACT FROM AUTHOR]

A family of inertial extragradient-type algorithms is proposed for solving convex pseudomonotone variational inequality with fixed-point problems, where the involved mapping for the fixed point is a ρ-demicontractive mapping. Under standard hypotheses, the generated iterative sequence achieves strong convergence to the common solution of the variational inequality and fixed-point problem. Some special cases and sufficient conditions that guarantee the validity of the hypotheses of the convergence statements are also discussed. Numerical applications in detail illustrate the theoretical results and comparison with existing methods. [ABSTRACT FROM AUTHOR]

In this paper, the problem of temperature distribution for convective straight fins with constant and temperature-dependent thermal conductivity is solved by using artificial neural networks trained by the biogeography-based heterogeneous cuckoo search (BHCS) algorithm. We have solved the integer and noninteger order energy balance equation in order to analyse the temperature distribution in convective straight fins. We have compared our results with homotopy perturbation method (HPM), variational iteration method (VIM), and homotopy perturbation Sumudu transform method (HPSTM). The results show that the ANN–BHCS algorithm gives better results than other analytical techniques. We have further checked the efficiency of the ANN–BHCS algorithm by using the performance metrics MAD, TIC, and ENSE. We have calculated the values of MAD, TIC, and ENSE for case 1 of the problem, and histograms of these metrics show the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]