Search

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., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2024 Yahaya et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

In 2012, Rivaie et al. introduced RMIL conjugate gradient (CG) method which is globally convergent under the exact line search. Later, Dai (2016) pointed out abnormality in the convergence result and thus, imposed certain restricted RMIL CG parameter as a remedy. In this paper, we suggest an efficient RMIL spectral CG method. The remarkable feature of this method is that, the convergence result is free from additional condition usually imposed on RMIL. Subsequently, the search direction is sufficiently descent independent of any line search technique. Thus, numerical experiments on some set of benchmark problems indicate that the method is promising and efficient. Furthermore, the efficiency of the proposed method is demonstrated on applications arising from arm robotic model and image restoration problems., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Salihu et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The free convective hybrid nanofluid (Fe3O4+MWCNT/H2O) magnetized non-Darcy flow over a porous cylinder is examined by considering the effects constant heat source and uniform ambient magnetic field. The developed coupled PDEs (partial differential equations) are numerically solved using the innovative computational technique of control volume finite element method (CVFEM). The impact of increasing strength of medium porousness and Lorentz forces on the hybrid nanofluid flow are presented through contour plots. The variation of the average Nusselt number (Nuave) with the growing medium porosity, buoyancy forces, radiation parameter, and the magnetic field strength is presented through 3-D plots. It is concluded that the enhancing medium porosity, buoyancy forces and radiation parameter augmented the free convective thermal energy flow. The rising magnetic field rises the temperature of the inner wall more drastically at a smaller Darcy number. An analytical expression for Nusselt number (Nuave) is obtained which shows its functional dependence on the pertinent physical parameters. The augmenting Lorentz forces due to the higher estimations of Hartmann retard the hybrid nanoliquid flow and hence enhance the conduction., Competing Interests: The authors have declared that no competing interests exist.

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]

Solving systems of nonlinear equations has evolved into an active research field, with numerous iterative methods being proposed. Notably, iterative methods characterized by fast convergence remain of interest. In this paper, based on the modified line search scheme by Ou and Li, we introduce a derivative-free algorithm with a relaxed-inertial technique for approximating solutions of nonlinear systems involving pseudo-monotone mappings in Euclidean space. The global convergence of the proposed algorithm is established without Lipschitz continuity of the underlying mapping. Moreover, our approach allows flexibility in selecting the inertial extrapolation step length within the interval [0, 1]. To show the efficiency of the proposed method, we embed a derivative-free search direction into the scheme. Numerical experiments are given to illustrate the efficiency of the proposed algorithm for large-scale systems and sparse signal reconstruction. [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]

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]

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]

This research article develops two adaptive, efficient, structured non-linear least-squares algorithms, NLS. The approach taken to formulate these algorithms is motivated by the classical Barzilai and Borwein (BB) (IMA J Numer Anal 8(1):141–148, 1988) parameters. The structured vector approximation, which is an action of a vector on a matrix, is derived from higher order Taylor series approximations of the Hessian of the objective function, such that a quasi-Newton condition is satisfied. This structured approximation is incorporated into the BB parameters' weighted adaptive combination. We show that the algorithm is globally convergent under some standard assumptions. Moreover, the algorithms' robustness and effectiveness were tested numerically by solving some benchmark test problems. Finally, we apply one of the algorithms to solve a robotic motion control model with three degrees of freedom, 3DOF. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of finding a zero of sum of two accretive operators in the setting of uniformly convex and q-uniformly smooth real Banach spaces (q > 1). We incorporate the inertial and relaxation parameters in a Halpern-type forward-backward splitting algorithm to accelerate the convergence of its sequence to a zero of sum of two accretive operators. Furthermore, we prove strong convergence of the sequence generated by our proposed iterative algorithm. Finally, we provide a numerical example in the setting of the classical Banach space l4(R) to study the effect of the relaxation and inertial parameters in our proposed algorithm. [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]

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, 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]

In this paper, using the concept of inertial extrapolation, we introduce a globally convergent inertial extrapolation method for solving nonlinear equations with convex constraints for which the underlying mapping is monotone and Lipschitz continuous. The method can be viewed as a combination of the efficient three-term derivative-free method of Gao and He [Calcolo. 55(4), 1-17, 2018] with the inertial extrapolation step. Moreover, the algorithm is designed such that at every iteration, the method is free from derivative evaluations. Under standard assumptions, we establish the global convergence results for the proposed method. Numerical implementations illustrate the performance and advantage of this new method. Moreover, we also extend this method to solve the LASSO problems to decode a sparse signal in compressive sensing. Performance comparisons illustrate the effectiveness and competitiveness of our algorithm. [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 the presented research article, the intelligence based numerical computation of artificial neural network backpropagated with Levenberg-Marquardt algorithm has been developed to analyze the novel ferrofluid flow model in the presence of magnetic dipole. Heat transfer effects are also incorporated along the horizontal. The designed fluid flow model initially represented by system of partial differential equations are converted into system of non-linear ordinary differential equations through suitable similarity transformations. The reference dataset of the possible outcomes is obtained from Adam numerical solver for the different scenarios of flow model by variation of co-efficient of the thermal expansion, Eckert number, suction parameter, magnetization and radiation parameter. The approximated solutions are interpreted for designed model by testing, training and validation process of backpropagated neural networks. Furthermore, the comparative studies and performance analysis of used algorithm is validated through regression analysis, histogram studies, correlation index and results of mean square error. [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]

This paper introduces the Euclidean, Hamming, and the generalized distance measures for picture fuzzy soft sets and discusses their properties. The numerical examples of decision-making and pattern recognition are focused. We also develop a robust VIKOR method for PFSSs. The relative and precise ideal picture fuzzy values (PFVs), robust factors and ranking indexes are defined. Different algorithmic procedures of robust VIKOR based on the relative and precise ideal PFVs, relative and precise robust factor, precise and picture fuzzy weights and relative and precise ranking indexes are proposed. In the end, the investment problem is solved by using the proposed method. [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]

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]

In this paper, we propose a Perry-type derivative-free algorithm for solving systems of nonlinear equations. The algorithm is based on the well-known BFGS quasi-Newton method with a modified Perry's parameter. The global convergence of the algorithm is established without assumption on the regularity or boundedness of the solution set. Meanwhile, the sequence of iterates generated by the algorithm converges globally to the solution of the problem provided that the function is Lipschitz continuous and monotone. Preliminary numerical experiments on some collection of general nonlinear equations and convex constrained nonlinear monotone equations demonstrate the efficiency of the algorithm. Moreover, we successfully apply the proposed algorithm to solve signal recovery problem. [ABSTRACT FROM AUTHOR]

In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward–backward splitting algorithm and the hybrid shrinking projection algorithm. We provide theoretical results concerning weak and strong convergence of the proposed algorithm towards a common solution of the fixed point problem associated to a finite family of demicontractive operators, the split equilibrium problem and the monotone inclusion problem in Hilbert spaces. Moreover, we compute a numerical experiment to show the efficiency of the proposed algorithm. As a consequence, our results improve various existing results in the current literature. [ABSTRACT FROM AUTHOR]

This paper proposes two algorithms that are based on a subgradient and an inertial scheme with the explicit iterative method for solving pseudomonotone equilibrium problems. The weak convergence of both algorithms is well-established under standard assumptions on the cost bifunction. The advantage of these algorithms is that they did not require any line search procedure or any knowledge about bifunction Lipschitz-type constants for step-size evaluation. A practical explanation of this is that they use a sequence of step-size that are revised at each iteration based on some previous iteration. For a numerical experiment, we consider a well-known Nash-Cournot equilibrium model of electricity markets and also other test problems to assist the well-established convergence results and be able to see that our proposed algorithms have a competitive advantage over the time of execution and the number of iterations. [ABSTRACT FROM AUTHOR]

In this paper, we construct a novel algorithm for solving non-smooth composite optimization problems. By using inertial technique, we propose a modified proximal gradient algorithm with outer perturbations, and under standard mild conditions, we obtain strong convergence results for finding a solution of composite optimization problem. Based on bounded perturbation resilience, we present our proposed algorithm with the superiorization method and apply it to image recovery problem. Finally, we provide the numerical experiments to show efficiency of the proposed algorithm and comparison with previously known algorithms in signal recovery. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new algorithm for solving a variational inequality problem in a Hilbert space. The algorithm originates from an explicit discretization of a dynamical system in time. We establish the convergence of the algorithm for a class of non-monotone and Lipschitz continuous operators, provided by the sequentially weak-to-weak continuity of cost operators. The rate of convergence of the algorithm is also proved under some standard hypotheses. Moreover, the new algorithm uses variable step-sizes which are updated at each iteration by a cheap computation without linesearch. This step-size rule allows the resulting algorithm to work more easily without the prior knowledge of Lipschitz constant of operator. Also, it is particularly interesting in the case where the Lipschitz constant is unknown or difficult to approximate. Several numerical experiments are implemented to illustrate the theoretical results and also to compare with existing algorithms. [ABSTRACT FROM AUTHOR]

An inertial iterative algorithm for approximating a point in the set of zeros of a maximal monotone operator which is also a common fixed point of a countable family of relatively nonexpansive operators is studied. Strong convergence theorem is proved in a uniformly convex and uniformly smooth real Banach space. This theorem extends, generalizes and complements several recent important results. Furthermore, the theorem is applied to convex optimization problems and to J-fixed point problems. Finally, some numerical examples are presented to show the effect of the inertial term in the convergence of the sequence of the algorithm. [ABSTRACT FROM AUTHOR]

In this research, we have investigated doubly singular ordinary differential equations and a real application problem of studying the temperature profile in a porous fin model. We have suggested a novel soft computing strategy for the training of unknown weights involved in the feed-forward artificial neural networks (ANNs). Our neuroevolutionary approach is used to suggest approximate solutions to a highly nonlinear doubly singular type of differential equations. We have considered a real application from thermodynamics, which analyses the temperature profile in porous fins. For this purpose, we have used the optimizer, namely, the fractional-order particle swarm optimization technique (FO-DPSO), to minimize errors in solutions through fitness functions. ANNs are used to design the approximate series of solutions to problems considered in this paper. We find the values of unknown weights such that the approximate solutions to these problems have a minimum residual error. For global search in the domain, we have initialized FO-DPSO with random solutions, and it collects best so far solutions in each generation/ iteration. In the second phase, we have fine-tuned our algorithm by initializing FO-DPSO with the collection of best so far solutions. It is graphically illustrated that this strategy is very efficient in terms of convergence and minimum mean squared error in its best solutions. We can use this strategy for the higher-order system of differential equations modeling different important real applications. [ABSTRACT FROM AUTHOR]

Restoring images corrupted by Poisson noise have attracted much attention in recent years due to its significant applications in image processing. There are various regularization methods of solving this problem and one of the most famous is the total variation (TV) model. In this paper, we present a new method based on accelerated alternating minimization algorithm (AAMA) which involves minimizing the sum of a Kullback–Leibler divergence term and a TV term for restoring Poisson noise degraded images. Our proposed algorithm is applied in solving the aforementioned problem and its convergence analysis is established under very weak conditions. In addition, the numerical examples reported demonstrate the efficiency and versatility of our method compared to existing methods of restoring images with Poisson noise. [ABSTRACT FROM AUTHOR]

In this paper, we are interested in solving minimization problem and common fixed point problem of finite family consisting asymptotically nonexpansive mappings in Hadamard spaces. For finding common solutions of their problems, we introduce a new modified proximal point algorithm involving convex combination technique. Under suitable conditions, Δ-convergence and strong convergence theorems are proved. Furthermore, we provide some numerical examples which show the efficiency and implementation of the proposed algorithm as well as show computational overview by comparing it with previously known algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we have designed a new optimization technique, which is named as the Improved Multi-verse Algorithm with Levy Flights (ILFMVO) algorithm. The quality of the population is an important factor that can directly or indirectly affect the strength of an algorithm in searching for the given search space for an optimal solution. Also, having an initialization of the initial population with randomly generated candidate solutions is not an effective idea in every case, especially when the search space is large. Hence, we have updated the Levy flights based Multi-verse Optimizer (LFMVO) by dividing initialization into two parts. To investigate the ability of ILFMVO, we have solved a constrained economic dispatch problem with a non-smooth, non-convex cost functions of three, six, and twenty thermal generator systems and two design engineering problems with nonlinear objectives and complex nonlinear constraints. We have compared our results with other standard algorithms. We have presented the sensitivity analysis to check the robustness and stability of our approach. The outcome demonstrated that ILFMVO has better accuracy, stability, and convergence. [ABSTRACT FROM AUTHOR]

In this paper, two algorithms are proposed for a class of pseudomonotone and strongly pseudomonotone equilibrium problems. These algorithms can be viewed as a extension of the paper title, the extragradient algorithm with inertial effects for solving the variational inequality proposed by Dong et al. (Optimization 65:2217–2226, 2016. 10.1080/02331934.2016.1239266). The weak convergence of the first algorithm is well established based on the standard assumption imposed on the cost bifunction. We provide a strong convergence for the second algorithm without knowing the strongly pseudomonoton and the Lipschitz-type constants of cost bifunction. The practical interpretation of a second algorithm is that the algorithm uses a sequence of step sizes that is converging to zero and non-summable. Numerical examples are used to assist the well-established convergence result, and we see that the suggested algorithm has a competitive advantage over time of execution and the number of iterations. [ABSTRACT FROM AUTHOR]

In this paper, we introduce new type iterative scheme called a 'modified Picard-S hybrid' iterative algorithm to establish Δ-convergence and strong convergence theorems under suitable conditions for total asymptotically nonexpansive mappings in CAT(0) spaces. Our results in the paper improve and extend many results appeared in the literature. Moreover, we also illustrate numerical examples for the proposed iteration process to compare speed of convergence among the existing iterative algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we modify the proximal point algorithm for finding common fixed points in CAT(0) spaces for nonlinear multivalued mappings and a minimizer of a convex function and prove Δ‐convergence of the proposed algorithm. A numerical example is presented to illustrate the convergence result. Our results improve and extend the corresponding results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we study the split common fixed point problem in Hilbert spaces. We find a common solution of the split common fixed point problem for two demicontractive operators without a priori knowledge of operator norms. A strong convergence theorem is obtained under some additional conditions and numerical examples are included to illustrate the applications in signal compressed sensing and image restoration. [ABSTRACT FROM AUTHOR]

Abstract In this paper, a new viscosity iterative method minimization algorithm for image restoration algorithm is proposed. Based on a new viscosity iteration, the algorithm for finding the common zeros of two accretive operators in the framework of uniformly smooth Banach spaces. Moreover, the strong convergence theorems for the iterative algorithms and an example is proposed which shows the validity of main theorem are proved. The results of this paper are improved and extended of the corresponding ones announced by many others and we also applied our result to solve a convex minimization problem and Gâteaux differentiable E P s and Variational Inequality. Experiment results show that the proposed algorithms outperform some other methods. Finally, we give the numerical experiments to show the efficiency and advantage of the proposed methods and we also used our proposed algorithm for applying to solve the image deblurring and image recovery problems. [ABSTRACT FROM AUTHOR]

In this work, we propose an algorithm for solving system of nonlinear equations. The idea is a combination of the descent Dai-Liao method by Babaie-Kafaki and Gambari (Optim. Meth. Soft. 29(3), 583–591, 2014) and the hyperplane projection method. Using the monotonicity and Lipschitz continuity assumptions, we prove that the proposed method is globally convergent. Examples of numerical experiment show that the method is promising and efficient compared to the method proposed by Sun et al. (Journal of Inequalities and Applications 236, 1–8, 2017). [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a general iterative method for finding a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of split variational inclusion problem in the framework Hilbert spaces. Strong convergence theorem of the sequences generated by the purpose iterative scheme is obtained. In the last section, we present some computational examples to illustrate the assumptions of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the modified proximal point algorithm for common fixed points of asymptotically quasi-nonexpansive mappings in CAT(0) spaces and also prove some convergence theorems of the proposed algorithm to a common fixed point of asymptotically quasi-nonexpansive mappings and a minimizer of a convex function. The main results in this paper improve and generalize the corresponding results given by some authors. Moreover, we then give numerical examples to illustrate and show efficiency of the proposed algorithm for supporting our main results. [ABSTRACT FROM AUTHOR]