Search

In a real Hilbert space, let the VIP denote a pseudomonotone variational inequality problem with Lipschitz continuity operator, and let the CFPP indicate a common fixed-point problem of finitely many nonexpansive mappings and an asymptotically nonexpansive mapping. On the basis of the Mann iteration method, the viscosity approximation method and the hybrid steepest-descent method, we propose and analyze two strengthened inertial-type subgradient extragradient rules with adaptive step sizes for solving the VIP and CFPP. With the help of suitable restrictions, we show the strong convergence of the suggested rules to a common solution of the VIP and CFPP, which is the unique solution of a hierarchical variational inequality (HVI). [ABSTRACT FROM AUTHOR]

In this paper, a model of deformations of a Stieltjes string with localized interactions with the environment (elastic supports and forces are concentrated at no more than countable set of points) is studied via variational methods. One of the boundary conditions is nonlinear and occurs due to a sleeve, which limits the movement of the right end of the string. The necessary and sufficient conditions for the extremum of the energy functional are established; the critical loads at which the contact of the end of the string with the sleeve occurs are determined; the dependence of the solution on the sleeve length is studied. [ABSTRACT FROM AUTHOR]

In the literature, the powers of a fuzzy matrix with max-arithmetic mean/convex combination of max-min and max-arithmetic mean/convex combination of max-product and max-min compositions have been studied. It turns out that the limiting behavior of the powers of a fuzzy matrix depends on the composition involved. In this paper, we consider the max-contraction powers of a fuzzy matrix which is an extension of the max-arithmetic mean/convex combination of max-min and max-arithmetic mean/convex combination of max-product and max-arithmetic mean operation. We show that the powers of such a fuzzy matrix are always convergent and the limit matrix has the feature that all elements of each column are identical. [ABSTRACT FROM AUTHOR]

The purpose of this paper is by using a generalized forward–backward splitting method to propose an iterative algorithm for finding a common element of the set of solutions to a system of quasi-variational inclusions with accretive mappings and the set of fixed points for a λ -strictly pseudo-contractive mapping in Banach spaces. Some strong convergence theorems of the sequence generated by the algorithm are proved. The results presented in the paper extend and improve some recent results. As applications, we utilize our results to study the approximation problem of solutions to a system of variational inequalities, accretive variational inequality problem and convex minimization problem in Banach spaces. [ABSTRACT FROM AUTHOR]

In this paper, we focus on weak-stability and saddle point theorems of multiobjective optimization problems that have an infinite number of constraints. The obtained results are based on the notion of weak-subdifferentials for vector functions. Some properties of weak stability for the problems are introduced. Relationships between strong duality and saddle points of the augmented Lagrange vector functions associated to the problems are investigated. Connections between weak-stability and saddle point theorems of the problems are established. An example is given. [ABSTRACT FROM AUTHOR]

Splitting methods have recently received much attention due to the fact that many nonlinear problems arising in applied areas such as image recovery, signal processing and machine learning are mathematically modeled as a nonlinear operator equation and this operator is decomposed as the sum of two (possibly simpler) nonlinear operators. Most of the investigation on splitting methods is however carried out in the framework of Hilbert spaces. In this paper, we consider these methods in the setting of Banach spaces. We shall introduce a viscosity iterative forward-backward splitting method with errors to find zeros of the sum of two accretive operators in Banach spaces. We shall prove the strong convergence of the method under mild conditions. We also discuss applications of these methods to monotone variational inequalities, convex minimization problem and convexly constrained linear inverse problem. [ABSTRACT FROM AUTHOR]

In the present paper we investigate the initial - boundary value problems describing oscillation processes with boundary conditions of hysteresis type. Analogues of the d’Alembert formula are obtained. Some control problems are analysed and explicit forms of control functions are presented. [ABSTRACT FROM AUTHOR]

The purpose of this article is to propose a splitting algorithm for finding a common zero of a finite family of inclusion problems of accretive operators in Banach space. Under suitable conditions, some strong convergence theorems of the sequence generalized by the algorithm to a common zero of the inclusion problems are proved. Some applications to the convex minimization problem, common fixed point problem of a finite family of pseudocontractive mappings, and accretive variational inequality problem in Banach spaces are presented. [ABSTRACT FROM AUTHOR]

In this paper, a new iterative scheme by hybrid projection method is proposed for a finite family of Bregman totally quasi-D-asymptotically nonexpansive mappings. Conditions ensuring strong convergence are imposed to common elements of set of common fixed points of the mappings and set of common solutions to a system of generalized mixed equilibrium problems in a reflexive Banach space. These results extend many important recent ones in the literature. [ABSTRACT FROM AUTHOR]

This paper deals with the uniformly stability (US), globally uniformly asymptotically stability (GUAS) and instability of zero solution as well as integrability and boundedness of nonzero solutions of certain nonlinear integro‐differential equations (IDEs). We prove five new theorems, which include sufficient conditions related to these fundamental qualitative properties of solutions to the IDEs considered. The main tools used in the proof are two new and suitable Lyapunov–Krasovskiiˇ functionals (LKFs). In particular cases, two numerical examples are given and solved via the fourth order Runge–Kutta method (RKM) in MATLAB to illustrate the theoretical results of this paper. Compared with the existing results on the fundamental qualitative behaviors of scalar IDEs, our results are new, original, more effective and convenient for tests and applications. [ABSTRACT FROM AUTHOR]

The generalized viscosity implicit rules for solving quasi-inclusion problems of accretive operators in Banach spaces are established. The strong convergence theorems of the rules to a solution of quasi-inclusion problems of accretive operators are proved under certain assumptions imposed on the sequences of parameters. The results presented in this paper extend and improve the main results of Refs. (Moudafi, J Math Anal Appl. 2000;241:46–55; Xu et al., Fixed Point Theory Appl. 2015;2015:41; López et al., Abstr Appl Anal. 2012;2012; Cholamjiak, Numer Algor. DOI:10.1007/s11075-015-0030-6.). Moreover, some applications to monotone variational inequalities, convex minimization problem and convexly constrained linear inverse problem are presented. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of a new nonlinear mapping called demigeneralized in a Banach space. Then, using the shrinking projection method, we prove a strong convergence theorem for finding a common fixed point for a family of the new nonlinear mappings in a Banach space. We apply this result to obtain new strong convergence theorems in a Hilbert space and a Banach space, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a relaxed extragradient iterative algorithm for finding a common element of the set of solutions of a general mixed equilibrium problem, the set of solutions of general system of variational inequalities, the set of solutions of finitely many variational inclusions, and the set of common fixed points of finitely many nonexpansive mappings and a strict pseudocontraction in a real Hilbert space. The iterative algorithm is based on Korpelevich's extragradient method, the viscosity approximation method, Mann's iterative method, and the strongly positive bounded linear operator approach. We derive the strong convergence of the iterative algorithm to a common element of these sets, which also solves some hierarchical minimization. [ABSTRACT FROM AUTHOR]

In this paper, by using the normal subdifferential and equilibrium-like function we first obtain some properties for K-preinvex set-valued maps. Secondly, in terms of this equilibrium-like function, we establish some sufficient conditions for the existence of super minimal points of a K-preinvex set-valued map, that is, super efficient solutions of a set-valued vector optimization problem, and also attain necessity optimality terms for a general type of super efficiency. [ABSTRACT FROM AUTHOR]

Abstract: Let and f be a continuous, strictly monotone real-valued function. The weighted quasi-arithmetic mean of two numbers a, b is defined by . Let be an real matrix and . We construct a function by for all . In this paper we show that has a unique fixed point . Moreover, it can be shown that for each the sequence , generated by the following iterative scheme: and for all , converges to the unique fixed point . Besides, some properties of the fixed point are derived. As an application, our results imply that the max-weighted quasi-arithmetic mean powers of any matrix are always convergent. The continuity of the function defined by is proposed as well. [Copyright &y& Elsevier]

We consider an abstract system consisting of the parabolic-type system of hemivariational inequalities (SHVI) along with the nonlinear system of evolution equations in the frame of the evolution triple of product spaces, which is called a system of differential hemivariational inequalities (SDHVI). A hybrid iterative system is proposed via the temporality semidiscrete technique on the basis of the Rothe rule and feedback iteration approach. Using the surjective theorem for pseudomonotonicity mappings and properties of the partial Clarke's generalized subgradient mappings, we establish the existence and priori estimations for solutions to the approximate problem. Whenever studying the parabolic-type SHVI, the surjective theorem for pseudomonotonicity mappings, instead of the KKM theorems exploited by other authors in recent literature for a SHVI, guarantees the successful continuation of our demonstration. This overcomes the drawback of the KKM-based approach. Finally, via the limitation process for solutions to the hybrid iterative system, we derive the solvability of the SDHVI with no convexity of functions u ↦ f l (t , x , u) , l = 1 , 2 and no compact property of C 0 -semigroups e A l (t) , l = 1 , 2 . [ABSTRACT FROM AUTHOR]

This study, that will be presented as two parts, develops a computational approach to a class of continuous-time generalized fractional programming problems. The parametric method for finite-dimensional generalized fractional programming is extended to problems posed in function spaces. The developed method is a hybrid of the parametric method and discretization approach. In this paper (Part I), some properties of continuous-time optimization problems in parametric form pertaining to continuous-time generalized fractional programming problems are derived. These properties make it possible to develop a computational procedure for continuous-time generalized fractional programming problems. However, it is notoriously difficult to find the exact solutions of continuous-time optimization problems. In the accompanying paper (Part II), a further computational procedure with approximation will be proposed. This procedure will yield bounds on errors introduced by the numerical approximation. In addition, both the size of discretization and the precision of an approximation approach depend on predefined parameters. [ABSTRACT FROM AUTHOR]

Background: An adaptive-network-based fuzzy inference system (ANFIS) was compared with an artificial neural network (ANN) in terms of accuracy in predicting the combined effects of temperature (10.5 to 24.5°C), pH level (5.5 to 7.5), sodium chloride level (0.25% to 6.25%) and sodium nitrite level (0 to 200 ppm) on the growth rate of Leuconostoc mesenteroides under aerobic and anaerobic conditions. Methods: The ANFIS and ANN models were compared in terms of six statistical indices calculated by comparing their prediction results with actual data: mean absolute percentage error (MAPE), root mean square error (RMSE), standard error of prediction percentage (SEP), bias factor (Bf), accuracy factor (Af), and absolute fraction of variance (R2). Graphical plots were also used for model comparison. Conclusions: The learning-based systems obtained encouraging prediction results. Sensitivity analyses of the four environmental factors showed that temperature and, to a lesser extent, NaCl had the most influence on accuracy in predicting the growth rate of Leuconostoc mesenteroides under aerobic and anaerobic conditions. The observed effectiveness of ANFIS for modeling microbial kinetic parameters confirms its potential use as a supplemental tool in predictive mycology. Comparisons between growth rates predicted by ANFIS and actual experimental data also confirmed the high accuracy of the Gaussian membership function in ANFIS. Comparisons of the six statistical indices under both aerobic and anaerobic conditions also showed that the ANFIS model was better than all ANN models in predicting the four kinetic parameters. Therefore, the ANFIS model is a valuable tool for quickly predicting the growth rate of Leuconostoc mesenteroides under aerobic and anaerobic conditions. [ABSTRACT FROM AUTHOR]

The theory presented in Part I (Wen in J. Optim. Theory Appl. 2012) of this study led to a theoretical parametric procedure for continuous-time generalized fractional programming problems. In this paper (Part II), an interval-type computational procedure by combining the parametric method and discretization approach is proposed. The proposed method is promising particularly when it is acceptable to find an effective, but near-optimal value in an efficient manner. Once the error tolerance is predetermined, we can determine the size of discretization in advance such that the accuracy of the corresponding approximate solution can be controlled within the predefined error tolerance. Hence, the trade-off between the quality of the results and the simplification of the problem can be controlled by the decision maker. Finally, we provide some numerical examples to implement our proposed method. [ABSTRACT FROM AUTHOR]

In this article, we discuss a class of continuous-time linear programming (CLP) problems. We provide a discrete approximation procedure to find numerical solutions of CLP, establish the estimation for the error bound and prove that the searched sequence of approximate solution functions weakly star converges to an optimal solution of CLP. Finally, we provide some numerical examples to implement our proposed method and to show the quality of the proposed error bound. [ABSTRACT FROM PUBLISHER]

This article proposes a practical computational procedure to solve a class of continuous-time linear fractional programming problems by designing a discretized problem. Using the optimal solutions of proposed discretized problems, we construct a sequence of feasible solutions of continuous-time linear fractional programming problem and show that there exists a subsequence that converges weakly to a desired optimal solution. We also establish an estimate of the error bound. Finally, we provide two numerical examples to demonstrate the usefulness of this practical algorithm. [ABSTRACT FROM PUBLISHER]

We investigate the problem of finding a common solution of a general system of variational inequalities, a variational inclusion, and a fixed-point problem of a strictly pseudocontractive mapping in a real Hilbert space. Motivated by Nadezhkina and Takahashi's hybrid-extragradient method, we propose and analyze new hybrid-extragradient iterative algorithm for finding a common solution. It is proven that three sequences generated by this algorithm converge strongly to the same common solution under very mild conditions. Based on this result, we also construct an iterative algorithm for finding a common fixed point of three mappings, such that one of these mappings is nonexpansive, and the other two mappings are strictly pseudocontractive mappings. [ABSTRACT FROM AUTHOR]

Very recently, Ahmad and Yao 2009( introduced and considered a system of generalized resolvent equationswith corresponding system of variational inclusions in uniformly smooth Banach spaces. In this paper we introduce and study a general system of generalized resolvent equations with corresponding general system of variational inclusions in uniformly smooth Banach spaces. We establish an equivalence relation between general system of generalized resolvent equations and general system of variational inclusions. The iterative algorithms for finding the approximate solutions of general system of generalized resolvent equations are proposed. The convergence criteria of approximate solutions of general system of generalized resolvent equations obtained by the proposed iterative algorithm are also presented. Our results represent the generalization, improvement, supplement, and development of Ahmad and Yao corresponding ones. [ABSTRACT FROM AUTHOR]

Assume that F is a nonlinear operator which is Lipschitzian and strongly monotone on a nonempty closed convex subset C of a real Hilbert space H. Assume also that Ω is the intersection of the fixed point sets of a finite number of Lipschitzian pseudocontractive self-mappings on C. By combining hybrid steepest-descent method, Mann's iteration method and projection method, we devise a hybrid iterative algorithm with perturbation F, which generates two sequences from an arbitrary initial point x0 є H. These two sequences are shown to converge in norm to the same point PΩx0 under very mild assumptions. [ABSTRACT FROM AUTHOR]

We consider an extension of the notion of well-posedness by perturbations, introduced by Zolezzi (1995, 1996) for a minimization problem, to a class of generalized mixed variational inequalities in Banach spaces, which includes as a special case the class of mixed variational inequalities. We establish some metric characterizations of the well-posedness by perturbations. On the other hand, it is also proven that, under suitable conditions, the well-posedness by perturbations of a generalized mixed variational inequality is equivalent to the well-posedness by perturbations of the corresponding inclusion problem and corresponding fixed point problem. Furthermore, we derive some conditions under which the well-posedness by perturbations of a generalized mixed variational inequality is equivalent to the existence and uniqueness of its solution. [ABSTRACT FROM AUTHOR]

It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional. In this paper, we introduce a new hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems in a real Hilbert space. It is proven that three sequences generated by this algorithm converge strongly to the unique solution of some variational inequality, which is also a common element of the set of solutions of a constrained convex minimization problem, the set of solutions of a generalized mixed equilibrium problem, and the set of fixed points of a strict pseudocontraction in a real Hilbert space. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we develop a discrete approximation method for solving continuous-time linear fractional programming problems. Our method enables one to derive a recurrence structure which shall overcome the computational curse caused by the increasing numbers of decision variables in the approximate decision problems when the subintervals are getting smaller and smaller. Furthermore, our algorithm provides estimation for the error bounds of the approximate solutions. We also establish the convergence of our approximate solutions to the continuous-time linear fractional programming problems. Numerical examples are provided to illustrate the quality of the approximate solutions. [Copyright &y& Elsevier]

This paper focuses on a classical problem of computing max-min inverse fuzzy relation. The resolution for the problem is useful for solving the well known problems of fuzzy abductive/backward reasoning. We propose a simple analytical method for finding its exact solutions or approximate solutions. Some examples are given to illustrate our results. [ABSTRACT FROM AUTHOR]

In this paper, we study the existence of solutions for non-coercive variational-hemivariational inequalities involving nonlocal fractional p-Laplacian. Our approach is based on the theory of pseudomonotone operators in the sense of Brézis, recession analysis and the properties of nonlocal fractional p-Laplace operators recently established.The innovation of this paper is that we do not assume the usual coercivity or smallness assumptions as stated in most existing literature. The absence of such assumptions will make the existence of solutions very complicated. We have to proceed from the specific problem itself and seek specific methods based on the inherent characteristics of different problems. [ABSTRACT FROM AUTHOR]

In this paper, we show the existence of solutions of the convex minimization problems and common fixed problems in CAT(1) spaces under some mild conditions. For this, we propose the new modified the proximal point algorithm. Further, we give some applications for the convex minimization problem and the fixed point problem in CAT(κ) spaces with the bounded positive real number κ. Our results improve and generalize many recent important results in the literature. [ABSTRACT FROM AUTHOR]

The primary objective is to investigate a class of noncoercive variational–hemivariational inequalities on a Banach space. We start with several new existence results for the abstract inequalities in which our approach is based on arguments of recession analysis and the theory of pseudomonotone operators. A nonsmooth elastic contact problem is considered as an illustrative application. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to find a common element in the intersection of the set of zeros of the inclusion problem of sum of two monotone mappings and the set of fixed points of a Bregman quasi nonexpansive mapping in a reflexive Banach space by using Bregman distance and shrinking projection method. Under suitable conditions, some strong convergence theorems are proved. As applications, we utilize our results to study the convex minimization problem, variational inequality problem. [ABSTRACT FROM AUTHOR]

This paper studies local stability of a parametric optimal control problem governed by semilinear elliptic equations with mixed pointwise constraints. We show that if the unperturbed problem satisfies the strictly nonnegative second-order optimality conditions, then the solution map is upper Hölder continuous in L ∞ -norm of control variable. [ABSTRACT FROM AUTHOR]

This paper studies the convergence of the Galerkin method and regularization for variational inequalities with pseudomonotone operators in the sense of Brézis. Namely, we prove that under certain conditions, the solutions of the Galerkin equations and regularized variational inequalities converge strongly to a solution of the original variational inequality in reflexive Banach spaces. An application for obstacle problems is given. [ABSTRACT FROM AUTHOR]

In this paper, we consider the split equality fixed point problem for quasi-pseudo-contractive mappings without a priori knowledge of operator norms in Hilbert spaces, which includes split feasibility problem, split equality problem, split fixed point problem, etc., as special cases. A unified framework for the study of this kind of problems and operators is provided. The results presented in the paper extend and improve many recent results. [ABSTRACT FROM AUTHOR]

In the present paper, we investigate the initial boundary value problem describing oscillation process on a geometric graph with hysteresis type boundary conditions. The analogue of the d'Alembert formula is obtained. [ABSTRACT FROM AUTHOR]

In a real Banach space X, we introduce for a non-empty set C in X the notion of suns in the sense of Bregman distances and show that C is such a sun if and only if C is convex. Also, we give some necessary and sufficient conditions for a compact set to be the Klee set, extending corresponding results on the Euclidean space. [ABSTRACT FROM AUTHOR]

In this paper, we deal with the control systems described by a large class of fractional semilinear parabolic equations. Firstly, we reformulate the fractional parabolic equations into abstract fractional differential equations associated with a semigroup on an appropriate Banach space. Secondly, we introduce a suitable concept on a mild solution for this kind of fractional parabolic equations and present the existence and uniqueness of mild solution by utilizing the theory of semigroup of linear operator, nonlinear analysis method and fixed point theorem. Then, the approximate controllability of the fractional semilinear parabolic equations is formulated and proved. At the end of the paper, an example is given to illustrate our main results. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and investigate the functions of ( μ, ν)-pseudo S-asymptotically ω-periodic of class r(class infinity). We systematically explore the properties of these functions in Banach space including composition theorems. As applications, we establish some sufficient criteria for ( μ, ν)-pseudo S-asymptotic ω-periodicity of (nonautonomous) semilinear integro-differential equations with finite or infinite delay. Finally, some interesting examples are presented to illustrate the main findings. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study the generalized-D-gap function for an equilibrium problem. We give sufficient conditions under which a critical point of the generalized-D-gap function is a solution of the equilibrium problem, and develop a descent scheme for locating these critical points. Using the generalized-D-gap function, we construct an error bound for the equilibrium problem. We support our approach with concrete examples. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to solve the hierarchical variational inequality with the constraint of a general system of variational inequalities in a uniformly convex and 2-uniformly smooth Banach space. We introduce implicit and explicit iterative algorithms which converge strongly to a unique solution of the hierarchical variational inequality problem. Our results improve and extend the corresponding results announced by some authors. [ABSTRACT FROM AUTHOR]

In this paper, using the concept of w-distances, and we prove existence theorems for single-valued mappings and set-valued mappings in a complete metric space which generalize Takahashi, Wong, and Yao's theorems. [ABSTRACT FROM AUTHOR]

The present paper deals with the common solution method for finding a fixed point of a nonexpansive mapping and a solution of split hierarchical Minty variational inequality problems. We discuss the weak convergence of the sequences generated by the proposed method to a common solution of a fixed point problem and a split hierarchical Minty variational inequality problem. An example is presented to illustrate the proposed algorithm and result. [ABSTRACT FROM AUTHOR]

In this paper, we introduce one composite implicit relaxed extragradient-like scheme and another composite explicit relaxed extragradient-like scheme for finding a common solution of a finite family of generalized mixed equilibrium problems (GMEPs) with the constraints of a system of generalized equilibrium problems (SGEP) and the hierarchical fixed point problem (HFPP) for a strictly pseudocontractive mapping in a real Hilbert space. We establish the strong convergence of these two composite relaxed extragradient-like schemes to the same common solution of finitely many GMEPs and the SGEP, which is the unique solution of the HFPP for a strictly pseudocontractive mapping. In particular, we make use of weaker control conditions than previous ones for the sake of proving strong convergence. Utilizing these results, we first propose the composite implicit and explicit relaxed extragradient-like schemes for finding a common fixed point of a finite family of strictly pseudocontractive mappings, and then we derive their strong convergence to the unique common solution of the SGEP and some HFPP. Our results complement, develop, improve, and extend the corresponding ones given by some authors recently in this area. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new viscosity approximation method by using the shrinking projection algorithm to approximate a common fixed point of a countable family of nonlinear mappings in a Banach space. Under quite mild assumptions, we establish the strong convergence of the sequence generated by the proposed algorithm and provide an affirmative answer to an open problem posed by Maingé (Comput. Math. Appl. 59:74-79, 2010) for quasi-nonexpansive mappings. In contrast with related processes, our method does not require any demiclosedness principle condition imposed on the involved operators belonging to the wide class of quasi-nonexpansive operators. As an application, we also introduce an iterative algorithm for finding a common element of the set of common fixed points of an infinite family of quasi-nonexpansive mappings and the set of solutions of a mixed equilibrium problem in a real Banach space. We prove a strong convergence theorem by using the proposed algorithm under some suitable conditions. Our results improve and generalize many known results in the current literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a hybrid extragradient viscosity iterative algorithm for finding a common element of the set of solutions of a general mixed equilibrium problem, the set of solutions of a general system of variational inequalities, the set of solutions of a split feasibility problem (SFP), and the set of common fixed points of finitely many nonexpansive mappings and a strict pseudocontraction in a real Hilbert space. The iterative algorithm is based on Korpelevich's extragradient method, viscosity approximation method, Mann's iteration method, hybrid steepest-descent method and gradient-projection method (GPM) with regularization. We derive the strong convergence of the iterative algorithm to a common element of these sets, which also solves some hierarchical variational inequality. [ABSTRACT FROM AUTHOR]

In this paper, we propose a descent direction method for solving variational inequalities. A new iterate is obtained by searching the optimal step size along a new descent direction which is obtained by the linear combination of two descent directions. Under suitable conditions, the global convergence of the proposed method is studied. Two numerical experiments are presented to illustrate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we investigate common solutions to a family of mixed equilibrium problems with a relaxed η- α-monotone mapping and a nonlinear operator equation involving an infinite family of asymptotically quasi- ϕ-nonexpansive mappings in the intermediate sense. Strong convergence theorems of common solutions are established in a strictly convex and uniformly smooth Banach space. These results extend many important recent ones in the literature. [ABSTRACT FROM AUTHOR]