Search

There are several applications for electro-osmotic MHD flow of hybrid Ferrofluid in the present era, notably in the biochemical as drug delivery systems, microfluidic devices, biomedical diagnostics, microscale systems and medical industries. The electro-osmotic MHD flow of a hybrid Ferrofluid containing Cobalt Ferrite, magnetite nanoparticles via a vertically inclined microchannel is investigated in this study. In furthermore, the perpendicular magnetic field is considered. Investigations are also carried into the effects of mass and heat transfer in this moving fluid. Partial differential equations provide as a representation for the aforementioned physical phenomenon, using suitable dimensionless nondimensional variables. Also, the classical system is fractionalized using the generalized Fourier and Fick's law. Generalizations are made based on the account of the Caputo derivative. The solution for the velocity, concentration, and temperature outlines is developed by using the Fourier and Laplace techniques. Moreover, the parametric impact of many physical factors as the Brinkman parameter, the temperature, velocity, concentration and stress parameters (Schmidt, Grashof, and Prandtl numbers). Graphs and discussions of concentration distributions is also discussed. The Sherwood number, rate of heat transmission, and skin friction are calculated and summarized. Since the fractional models are more accurate, they also provide a broader variety of possible solutions. Considering the relevant data, these solutions could be the best. Additionally, the heat transfer rate is higher as compare to nanofluid and regular fluid. The Hybrid Ferrofluid having capability to control velocity boundary layer rapidly as compare to nanofluid and regular fluid. [ABSTRACT FROM AUTHOR]

In this article, we propose a viscosity-type scheme for approximating a common solution of convex minimization problem, monotone vector field inclusion problem and fixed point problem involving multi-valued nonexpansive mapping in the framework of Hadamard spaces. We obtain a strong convergence theorem for the sequence generated therefrom to a solution of the problem. Furthermore, we apply our results to compute the Fréchet mean, find the mean of probabilities, minimize energy of measurable mappings and solve a problem of two-arm robotic motion control. Finally, we give numerical example to demonstrate the applicability of the method and also issue comparisons with some existing methods. Our results extend and complement some recent results in the literature. [ABSTRACT FROM AUTHOR]

In this work, the main discussion centres on avoiding the use of triangle inequality while proving Cauchy sequence to establish best proximity point theorems for single valued as well as multivalued non-self mappings. We prove such best proximity point theorems in the setting of non-triangular metric spaces and elaborate through examples. In this process host of the existing best proximity results are generalized and improved. To arouse further interest in the subject, we connect this work in solving a specific type of partial differential equation problem. [ABSTRACT FROM AUTHOR]

Mineral Oil [MO] has significant importance because of its vast variety of applications in various arenas of manufacturing, technology, and industrial processes. The applications of the Mineral Oil [MO] are PVC production, polystyrene production, as a lubricating, cutting fluid, thermoplastics rubber production, glossing product, wood products, cleaning products, lamp oil, glues, toys, veterinary, cosmetics, food preparation, as a brake fluid in some cars, and so forth. Due to these applications of Mineral Oil [MO], in the existing work, the two-dimensional mixed convective flow of micropolar fluid with the applications of the aluminum oxide nanoparticles in a Mineral Oil [MO] base liquid is taken into consideration. The melting heat phenomenon is discussed for the interpretation of heat transmission. Further, the flow analysis is discussed through the impacts of inclined magnetic field, heat generation, Joule heating and thermal radiation. Mass diffusivity is deliberated through the implementation of homogenous and heterogeneous chemical reactions. Entropic behavior is analyzed for the discussion of irreversibility analysis. Suitable similarity transformations are employed to renovate modeled systems of the PDEs into ODEs. Analytical simulation of the proposed model has been accomplished with the utilization of the homotopy analysis technique. Some significant outcomes from the existing work are that the velocity outline is reduced but the energy curve is greater for the melting parameter. Nanofluid entropy generation is increased due to the improvement of the Brinkman parameter and material parameter. Heat transportation is augmented due to the amplification of the radiation parameter, and nanoparticle volume fraction. The present study is useful in different fields of industries, technological processes, mechanical processes, and electrical processes due to the applications of mineral oil. [ABSTRACT FROM AUTHOR]

Diathermal oils have piqued the interest of several researchers in recent years due to their numerous industrial applications. The core aim of this study is the development of a novel fractal-fractional model to analyze the thermal performance of an oil-based tripartite hybrid nanofluid for channel flows. Graphene (Gr), magnesium oxide (MgO), and copper (Cu) nanoparticles are simultaneously dispersed in engine oil to obtain a tripartite hybrid nanofluid. To evaluate the impacts of the shape factor on thermal performance, five different shapes (brick, blade, spherical, platelet, and cylindrical) of nanoparticles are considered. The flow of considered fluid starts due to the constant motion of the right wall, which also encounters constant heating. Meanwhile, the left wall absorbs uniform radiation impacts. The mathematical model to explain this physical process is formulated by utilizing a fractal-fractional derivative, which involves a power-law kernel in its working. This model is exposed to joint employment of classical and fractal Laplace transforms to acquire the analytic solutions. These solutions are further used to develop expressions for skin friction coefficient and Nusselt number. Based on these quantities, heat transfer rate and shear stress are estimated to analyze augmentation in the thermal potential of engine oil and to observe variation in shear stress because of parametric effects. By conducting a comparative analysis between graphs of fractional and fractal-fractional models, it is concluded that a better elucidation of memory effects can be provided through the fractal-fractional approach. Furthermore, this work highlights that dispersing three different types of nanoparticles in engine oil makes it a more effective industrial fluid with a 9.58% higher heat-conduction capacity. This significant enhancement in the thermal performance of engine oil signifies its effectiveness for lubrication and cooling applications. [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 paper discusses a new derivative-free line search method for nonlinear monotone equations. It uses a derivative-free direction based on Dai–Liao method, along which an improved line search – called IDFLS – is tried. In contrast to the basic line search method – called BasicLS – by Solodov and Svaiter, IDFLS uses extrapolation steps to guarantee a decrease in the function norm. In fact, IDFLS never accept a point with the worst function norm, while BasicLS may accept such a point. The global convergence of our method is established under the assumption that the underlying mapping is monotone. The numerical results show that the new method is competitive in comparison with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In this paper, we construct three new extragradient-type iterative methods for solving variational inequalities in real Hilbert spaces. The proposed iterative methods are functionally equivalent to the extragradient method, which is used to solve variational inequalities in an infinite-dimensional real Hilbert space. The main advantage of these iterative methods is that they use a simple step size rule based on operator information instead of the Lipschitz constant or any line search method. Three strong convergence theorems are well proved, corresponding to the proposed methods by allowing certain control parameter conditions. Finally, we present some numerical experiments to verify the efficacy and superiority of the proposed iterative methods. [ABSTRACT FROM AUTHOR]

In this article, we present two Tseng's methods for finding a singularity point of an inclusion problem which is defined by means of a sum of a single-valued vector field and a multivalued vector field on a Hadamard manifold. Under standard assumptions, we prove any sequence generated by the proposed methods converges to a singularity point, whenever it exists. Moreover, applications to convex minimization problems and variational inequality problems are provided. [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]

In this paper, we propose a hybrid conjugate gradient method for unconstrained optimization, obtained by a convex combination of the LS and KMD conjugate gradient parameters. A favourite property of the proposed method is that the search direction satisfies the Dai–Liao conjugacy condition and the quasi-Newton direction. In addition, this property does not depend on the line search. Under a modified strong Wolfe line search, we establish the global convergence of the method. Numerical comparison using a set of 109 unconstrained optimization test problems from the CUTEst library show that the proposed method outperforms the Liu–Storey and Hager–Zhang conjugate gradient methods. [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 article, we present an inertial subgradient extragradient-type method that uses a non-monotone step size rule to find a numerical solution to equilibrium problems in real Hilbert spaces. The presented iterative scheme is based on an extragradient subgradient method and an inertial-type scheme. In fact, the proposed iterative scheme is effective in terms of performance, and the key advantage derives directly from the use of the variable step size rule, which is revised by each iteration on the basis of the Lipschitz-type constants as well as certain prior iterations. We obtain a weak convergence theorem for a new method by using mild conditions on a bifunction. Applications of the main results are given to solve various nonlinear problems. Several numerical findings are given in order to illustrate the numerical behaviour of the proposed method and to compare it to others. [ABSTRACT FROM AUTHOR]

In this paper, a derivative-free Hestenes–Stielfel type method is proposed to solve large-scale nonlinear equations with convex constraints. The proposed method adopts the line search proposed by Ou and Li [J. Comput. Appl. Math. 56(1-2) (2018), pp. 195–216]. Unlike most existing methods, the global convergence of the proposed method is established under the assumption that the underlying mapping is Lipschitz continuous and satisfies a weaker monotonicity condition. Preliminary numerical experiments indicate that the proposed method is effective and promising. Furthermore, the proposed method is used to solve image restoration problem in compressive sensing. [ABSTRACT FROM AUTHOR]

Non-Newtonian fluids flow with mixed convection has got the researcher's attention due to its widespread application in engineering and manufacturing systems. Furthermore, the thermal radiation in convective thermal transmission plays a key role in regulating the thermal transmission. That's why the authors' interest comes to the point to present a detailed analysis of the mixed convective flow of Casson and Oldroyd-B fluids through a linearly stratified stretching sheet. Also, the flow of Casson and Oldroyd-B fluids are considered as chemically reactive, thermally radiative, and magnetized by a strong magnetic field. The mathematical model of the present analysis is presented in PDEs (partial differential equations) format which is transformed into ODEs (ordinary differential equations) by employing suitable variables. The transformed ODEs are treated with an analytical technique called HAM (Homotopy analysis method) which provides an analytical solution for both linear and nonlinear differential equations. Through the use of diagrams, the converging exploration of HAM is depicted. An interesting result has been introduced that, the streamlines of Casson liquid are highly affected by a strong magnetic field as compared to Oldroyd-B liquid. The strong magnetic field and buoyancy ratio parameter moderate the velocity profile, while an opposite trend is found in the motion of liquid by using mixed convectional factors. Additionally, the impacts of magnetic and buoyancy ratio parameters are greater for Oldroyd-B fluid as associated with Casson liquid. On the other hand, the mixed convection parameter is stronger for Casson liquid as equated to Oldroyd-B fluid. The present results have a great agreement with previously published results. [ABSTRACT FROM AUTHOR]

In this paper, we proposed two different methods for solving pseudomonotone and strongly pseudomonotone equilibrium problems. We can examine these methods as an extension and improvement of the Popov's extragradient method. We replaced the second minimization problem onto a closed convex set in the Popov's extragradient method, with a half-space minimization problem that is updated on each iteration and also formulates a useful method for determining the appropriate stepsize on each iteration. The weak convergence theorem of the first method and strong convergence theorem for the second method is well-established based on a standard assumption on a cost bifunction. We also consider various numerical examples to support our well-established convergence results, and we can see that the proposed methods depict a significant improvement in terms of the number of iterations and execution time. [ABSTRACT FROM AUTHOR]

The aim of this article is to introduce new iterative algorithms for finding a common solution from the set of equilibrium points of an equilibrium problem and of singularities of an inclusion problem on Hadamard manifolds. We discuss some particular cases of the problem with the proposed algorithms. The convergence results of a sequence generated by the proposed algorithms are proved under mild assumptions on a Hadamard manifold. Moreover, we apply our results to solve optimization problems and variational inequality problems. [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, 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 discuss about monotone vector fields, which is a typical extension to the theory of convex functions, by exploiting the tangent space structure. This new approach to monotonicity in CAT (0) spaces stands in opposed to the monotonicity defined earlier in CAT (0) spaces by Khatibzadeh and Ranjbar [J. Aust. Math. Soc. 103(1), 70–90 (2017).] and Chaipunya and Kumam [Optimization 66(10), 1647–1665 (2017).]. In particular, this new concept extends the theory from both Hilbert spaces and Hadamard manifolds, while the known concept barely has any obvious relationship to the theory in Hadamard manifolds. We also study the corresponding resolvents and Yosida approximations of a given monotone vector field and derive many of their important properties. Finally, we prove a generation theorem by showing convergence of an exponential formula applied to resolvents of a monotone vector field. Our findings improve several known results in the literature including generation theorems of Jost [AMS/IP Stud. Adv. Math., vol. 8, pp. 1–47. Amer. Math. Soc., Providence, RI (1998)], Mayer [Comm. Anal. Geom. 6(2), 199–253 (1998).], Stojkovic [Adv. Calc. Var. 5(1), 77–126 (2012).], and Bačák [Convex analysis and optimization in Hadamard spaces, De Gruyter Series in Nonlinear Analysis and Applications, vol. 22. De Gruyter, Berlin (2014).] for proper, convex, lower semicontinuous functions in the context of complete CAT (0) spaces, and also by Iwamiya and Okochi [Nonlinear Anal. 54(2), 205–214 (2003).] for monotone vector fields in the context of Hadamard manifolds. [ABSTRACT FROM AUTHOR]

This paper introduces a novel model with six parameters called "flexible additive Weibull distribution (FAWD)." The suggested model is capable to model the life time data with a non-monotonic hazard rate. The statistical properties of the new distribution including Renyi entropy, quantile function, maximum likelihood estimation, order statistics, moment generating function, probability generating function, factorial and characteristic function are discussed in details. The flexibility of the proposed distribution is judged based on AIC, CAIC, BIC and HQIC, the smaller is the value of these statistics, and the better is the results. The usefulness of the proposed distribution is illustrated by using two real data sets. The proposed distribution has shown better performance and fits the used data better than some other well-known distributions. [ABSTRACT FROM AUTHOR]

This paper concerns noncooperative difference games with infinite horizon discounted payoffs. More precisely, it is a sequel to a previous paper [A. Fonseca-Morales and O. Hern'andez-Lerma, Potential differential games, Dynamic Games Appl., 8(2) (2018), pp. 254–279.] where the notion of continuous-time potential games was introduced. That is, a noncooperative differential game to which we can associate a continuous-time optimal control problem (OCP) whose solutions are Nash equilibria for the original game. Thus, finding or analysing the properties of Nash equilibria for the game reduces to that of the optimal solution of an OCP. Here, we study difference games, that is, the discrete-time case. First, we give several mild conditions for which a difference game is a potential difference game (PDG). Then, we illustrate our results with several examples and applications. [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 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]

In this work, our interest is to investigate the monotone inclusion problem in the framework of real Hilbert spaces. For solving the inclusion problem, we propose a composite iteration for approximating a zero of sum of two operators. We prove its strong convergence under some mild conditions. Finally, we provide a number of applications to convex minimization and image restoration problems including numerical experiments to support our main theorem. [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]

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 research, we are interested about the monotone inclusion problems in the scope of the real Hilbert spaces by using an inertial forward–backward splitting algorithm. In addition, we have discussed the application of this algorithm. [ABSTRACT FROM AUTHOR]

In this article, a semi-analytical technique is implemented to solve Kuramoto–Sivashinsky equations. The present method is the combination of two well-known methods namely Laplace transform method and variational iteration method. This hybrid property of the proposed method reduces the numbers of calculations and materials. The accuracy and applicability of the suggested method is confirmed through illustration examples. The accuracy of the proposed method is described in terms of absolute error. It is investigated through graphs and tables that the Laplace transformation and variational iteration method (LVIM) solutions are in good agreement with the exact solution of the problems. The LVIM solutions are also obtained at different fractional-order of the derivative. It is observed through graphs and tables that the fractional-order solutions are convergent to an integer solution as fractional-orders approaches to an integer-order of the problems. In conclusion, the overall implementation of the present method support the validity of the suggested method. Due to simple, straightforward and accurate implementation, the present method can be extended to other non-linear fractional partial differential equations. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new modified proximal point algorithm for nonexpansive mappings in non-positive curvature metric spaces and also we prove the sequence generated by the proposed algorithms converges to a common solution between minimization problem and fixed point problem. Moreover, we give some numerical examples to illustrate our main results, that is, our algorithm is more efficient than the algorithm of Cholamjiak et al. and others. [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 introduce a new discontinuous operator and investigate the existence and uniqueness of fixed points for the operators in complete metric spaces. We also provide rate of convergence and data dependency of S-iterative scheme for a fixed point of the discontinuous operators in Banach spaces. Moreover, we prove the estimation Collage theorems and compare error estimate between data dependency and Collage theorems. Numerical examples are provided to support our results. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the new method for solving the intuitionistic fuzzy transportation problem (IFTP), by using north-west corner method and modified distribution method to find the optimal solution for IFTP. [ABSTRACT FROM AUTHOR]

In this paper, we prove some random fixed point theorems for Hardy-Rogers self-random operators in separable Banach spaces and, as some applications, we show the existence of a solution for random nonlinear integral equations in Banach spaces. Some stochastic versions of deterministic fixed point theorems for Hardy-Rogers self mappings and stochastic integral equations are obtained. [ABSTRACT FROM AUTHOR]

In this paper, we consider a common solution of three problems in Hilbert spaces including the split generalized equilibrium problem, the variational inequality problem and fixed point problem. For finding the solution, we present a new iterative method and prove the strongly convergence theorem under mild conditions. Moreover, some numerical examples are given in the last section. [ABSTRACT FROM PUBLISHER]

Proximal point method is one of the most influential procedure in solving nonlinear variational problems. It has recently been introduced in Hadamard spaces for solving convex optimization, and later for variational inequalities. In this paper, we study the general proximal point method for finding a zero point of a maximal monotone set-valued vector field defined on a Hadamard space and valued in its dual. We also give the relation between the maximality and Minty’s surjectivity condition, which is essential for the proximal point method to be well-defined. By exploring the properties of monotonicity and the surjectivity condition, we were able to show under mild assumptions that the proximal point method converges weakly to a zero point. Additionally, by taking into account the metric subregularity, we obtained the local strong convergence in linear and super-linear rates. [ABSTRACT FROM AUTHOR]

In this paper, we regard theCQalgorithm as a fixed point algorithm for averaged mapping, and also try to study the split feasibility problem by the following hybrid steepest method;where {αn}⊂(0,1). It is noted that Xu’s original iterative method can conclude only weak convergence. Consequently, we obtain the sequence {xn} generated by our iteration method converges strongly to, whereis the unique solution of the variational inequalityOur result extends and improves the result of Xu, as shown in the literature, from weak to strong convergence theorems. Finally, in the last section, numerical examples for study behavior convergence analysis of this algorithm are obtained. [ABSTRACT FROM AUTHOR]

In this paper, we present an iterative scheme for Bregman strongly nonexpansive mappings in the framework of Banach spaces. Furthermore, we prove the strong convergence theorem for finding common fixed points with the set of solutions of an equilibrium problem. [ABSTRACT FROM AUTHOR]

We introduce a new hybrid projection method in mathematical programming for finding a common element of the set of common fixed points of a countable family of relatively quasi-nonexpansive mappings, the set of the variational inequality for an-inverse-strongly monotone operator, the set of solutions of the mixed equilibrium problem and a zero of a maximal monotone operator in the framework of a real Banach space. We obtain a strong convergence theorem for the sequences generated by this process in a 2-uniformly convex and uniformly smooth Banach space. Furthermore, we give some numerical examples which support our main theorem in the last part. [ABSTRACT FROM AUTHOR]

The proposal of this article is to construct a new modified block by using the hybrid projection method and prove the strong convergence theorem for this method, which include the fixed point set of an infinite family of weak relatively nonexpansive mappings and zeroes of a finite family of maximal monotone operators in a uniformly smooth and strictly convex Banach space with the Kadec–Klee property. The results presented in this article improve and generalize some well-known results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we present fixed point theorems for a generalized Roger Hardy type F-contraction in metric-like spaces and also give some examples to illustrate the main results in this paper. Moreover the applications of second-order differential equations and fractional differential equations are shown. The existing results improve and extend the corresponding results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the method for solving fuzzy transportation problem (FTP) using Robust’s ranking technique for the representative value of the fuzzy number. In addition we are using allocation table method (ATM) to find an initial basic feasible solution (IBFS) for the FTP. Moreover, this method is also good optimal solution in the literature and illustrated with numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we establish some fixed point results for fuzzy mapping in a complete b-metric space. Our results unify, extend and generalize several results in the existing literature. Example is also given to support our results. [ABSTRACT FROM AUTHOR]

Existence of fixed point for C-class functions was first proved by Ansari in 2014. Then, many authors gave interesting results using C-class functions. In this paper, we prove the existence of strong coupled proximity point for generalised cyclic coupled proximal maps. Our result generalises the results of Kadwin and Marudai. [ABSTRACT FROM AUTHOR]

In the present paper, we introduce the notion of A-cone metric spaces over Banach algebra as a generalization of A-metric spaces and cone metric spaces over Banach algebra. We also defined generalized Lipschitz and expansive maps in such maps and establish some fixed point theorems for such maps in the setting of the new space. As an application, we prove a theorem for integral equation. We provide illustrative example to verify our results. Our results generalize and unify some well-known results in the literature. [ABSTRACT FROM AUTHOR]