Search

In this paper, we present several remarks on the paper by Yao et al. (citeyearcite.nine). The results presented in the present paper are interesting improvements on the main results of Yao et al. [ABSTRACT FROM AUTHOR]

In this note, we give affirmative answers to two open problems posed by Agarwal et al. in the paper (J Optim Theory Appl 163(2):482-490, ). [ABSTRACT FROM AUTHOR]

In this paper we clarify that the interior proximal method developed in [6] (vol. 27 of this journal) for solving variational inequalities with monotone operators converges under essentially weaker conditions concerning the functions describing the "feasible" set as well as the operator of the variational inequality. [ABSTRACT FROM AUTHOR]

In this note, we take care of a gap in Remark 2.1 of Mishra and Laha ('On approximately star-shaped functions and approximate vector variational inequalities', Mishra and Laha in J. Optim. Theory Appl. 156:278-293, ) and modify the corresponding results. [ABSTRACT FROM AUTHOR]

In this paper, we state that generalized convexity, invex sets, and the Fr'echet differentiability assumption associated with curvilinear integral type functionals represent some necessary and sufficient mathematical tools for establishing various connections between the solutions of some robust (weak) vector commanded variational inequalities and (weak, proper) robust efficient solutions of the corresponding multi-objective variational control problem. In addition, the physical motivation of the problem under investigation is formulated in the illustrative application given at the end of this paper. [ABSTRACT FROM AUTHOR]

Some new classes of general harmonic convex sets and convex functions are introduced and studied in this paper. The optimality criteria of the differentiable general harmonic functions is characterized by the general harmonic variational inequalities. Special cases are also pointed out as applications of the new concepts. Auxiliary principle technique involving an arbitrary operator is applied to suggest and analysis several inertial type methods are suggested. Convergence criteria is investigated of the proposed methods under weaker conditions. The results obtained in this paper may inspire further research along with implementable numerical methods for solving the general harmonic variational inequalities and related optimization problems. [ABSTRACT FROM AUTHOR]

In this paper, for 0 < x < π/2 and r > 0, we consider the following Iyengar-Madhava Rao-Nanjundiah type inequality; cos (x√3 +αxr) < sinx/x < cos (x/√3 +βxr). Our main theorems shows that α and β depend on r > 0, and if 0 < r < 3 then β = (2/π)r (−2√3 +arccos 2/π) and if r > 4 then α = (2/π)r (− π/2√3 +arccos 2/π). [ABSTRACT FROM AUTHOR]

In this paper, we propose an iterative algorithm, which is based on the Mann iterative method for solving simultaneously common fixed point problem with a finite family of demicontractive mappings and systems of variational inequalities involving an infinite family of strongly accretive operators. Under suitable assumptions, we prove the strong convergence of this algorithm in Banach spaces. Application to systems of constrained convex minimization problem is provided to support our main results. The results of this paper improve and extend results of [M. Eslamian, C. R. Math. Acad. Sci. Paris, 355 (2017), 1168–1177], and of many others. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a regularized iterative scheme for solving the split common fixed point problem of asymptotically demicontractive and demimetric mappings in real Banach spaces. We then prove that the iterative scheme converges strongly to a solution to the problem, which is also a solution to a variational inequality problem. A split feasibility problem is also considered with the aid of our scheme. [ABSTRACT FROM AUTHOR]

This paper is devoted to some adaptive methods for variational inequalities with relatively smooth and relatively strongly monotone operators. Based on the recently proposed proximal version of the extragradient method for this class of problems, we study in detail the method with adaptively selected parameter values. The rate of convergence of this method is estimated. The result is generalized to the class of variational inequalities with relatively strongly monotone δ-generalized smooth operators. For the ridge regression problem and variational inequality associated with box-simplex games, numerical experiments are carried out to demonstrate the effectiveness of the proposed technique for adaptive parameter selection during the execution of the algorithm. [ABSTRACT FROM AUTHOR]

This paper aims to study the oscillatory nature of solutions for fourth-order neutral differential equations with mixed deviating arguments and improved oscillation conditions obtained in various cases. We reduced the problem to first-order differential inequality by using suitable substitutions that enabled us to use comparison theorems. Further, we discuss the asymptotic nature of solutions, and in the end, an example is given to validate the results. [ABSTRACT FROM AUTHOR]

In this paper, we introduced a new double inertial subgradient extragradient method for solving a variational inequality problem in Hilbert space. In our method, the mapping needed not to satisfy any assumption of monotonicity and two different self-adaptive step sizes were used for avoiding the need of Lipschitz constant of the mapping. The strong convergence of the proposed method was proved under some new conditions. Finally, some numerical examples were presented to illustrate the convergence of our method and compare with some related methods in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we establish some upper bound estimates for the maximum modulus of the higher order derivative of a polynomial with restricted zeros on a circle of |z| = R, R ≥ 1, in terms of the maximum modulus of the same polynomial on the unit circle |z| = 1. These results generalize and sharpen some known results in this direction. [ABSTRACT FROM AUTHOR]

We devise an iterative algorithm incorporating inertial techniques to approximate the shared solution of a generalized equilibrium problem, a fixed point problem for a finite family of relatively nonexpansive multivalued mappings, and a variational inequality problem. Our discussion encompasses the strong convergence of the proposed algorithm and highlights specific outcomes derived from our theorem. Additionally, we provide a computational analysis to underscore the significance of our findings and draw comparisons. The results presented in this paper serve to extend and unify numerous previously established outcomes in this particular research domain. [ABSTRACT FROM AUTHOR]

In this paper, we have introduced some viscosity-type inertial iterative methods for solving fixed point and variational inclusion problems in Hilbert spaces. Our methods calculated the viscosity approximation, fixed point iteration, and inertial extrapolation jointly in the starting of every iteration. Assuming some suitable assumptions, we demonstrated the strong convergence theorems without computing the resolvent of the associated monotone operators. We used some numerical examples to illustrate the efficiency of our iterative approaches and compared them with the related work. [ABSTRACT FROM AUTHOR]

In this paper, we prove an existence result for a quasilinear elliptic variational inequality of the form u ∈ K ⊂ V : 0 ∈ - Δpu+aF(u) + ...IK(u) ∈ V* in the whole ℝ N under bilateral constraints K given by K = {v ∈ V : ϕ (x) ≤ v(x) ≤ Ψ(x) a.e. in ℝ N}, where Δp is the p-Laplacian, the underlying solution space V is the homogeneous Sobolev space (also called Beppo-Levi space) V = D1,p(ℝN) with 1 < p < N, and IK : V → ℝ U {+∞} is the indicator functional corresponding to K with its subdifferential ...IK. The lower order Nemytskij operator F is generated by a Carathéodory function f : ℝN x ℝ → ℝ, and the measurable and bounded coefficient α is supposed to decay like |x|- (N+α) at infinity. The growth conditions that we impose on f are such that the operator -- Δp + aF : V → V*, in general, is not coercive with respect to K which prevents us from applying standard existence results. Another difficulty, which arises due to the lack of compact embedding of V into Lq(ℝN) spaces, needs to be overcome in an appropriate way. Without assuming additional assumptions such as the existence of sub- and supersolutions, we are able not only to prove the existence of solutions, but also show the compactness of the set of all solutions in V. Finally, an extension of the theory is established, which allows us to deal with noncoercive bilateral variational-hemivariational inequalities in ℝN. The proof of our main existence result is based on a modified penalty approach. [ABSTRACT FROM AUTHOR]

In 2012, Censor et al. (Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space. Optimization 61(9):1119–1132, 2012b) proposed the two-subgradient extragradient method (TSEGM). This method does not require computing projection onto the feasible (closed and convex) set, but rather the two projections are made onto some half-space. However, the convergence of the TSEGM was puzzling and hence posted as open question. Very recently, some authors were able to provide a partial answer to the open question by establishing weak convergence result for the TSEGM though under some stringent conditions. In this paper, we propose and study an inertial two-subgradient extragradient method (ITSEGM) for solving monotone variational inequality problems (VIPs). Under more relaxed conditions than the existing results in the literature, we prove that proposed method converges strongly to a minimum-norm solution of monotone VIPs in Hilbert spaces. Unlike several of the existing methods in the literature for solving VIPs, our method does not require any linesearch technique, which could be time-consuming to implement. Rather, we employ a simple but very efficient self-adaptive step size method that generates a non-monotonic sequence of step sizes. Moreover, we present several numerical experiments to demonstrate the efficiency of our proposed method in comparison with related results in the literature. Finally, we apply our result to image restoration problem. Our result in this paper improves and generalizes several of the existing results in the literature in this direction. [ABSTRACT FROM AUTHOR]

In this paper, an inertial subgradient extragradient algorithm is proposed to solve the pseudomonotone variational inequality problems in Banach space. This iterative scheme employs a new line-search rule. Strong convergence theorems for the proposed algorithms are established under the assumptions that the operators are non-Lipschitz continuous. Furthermore, several numerical experiments are given to show that our method has better convergence performance than the known ones in the literatures. [ABSTRACT FROM AUTHOR]

In this paper, we consider a new class of variational inequalities involving two operators, which is called the general variational inequality. We have shown that the general variational inequalities are equivalent to the fixed point problem using the projection technique. This equivalent fixed point formulation is used to discuss the existence of solution as well as to investigate several iterative methods for solving general variational inequalities. Some applications of the associated dynamical system coupled with finite difference are explored. Convergence analysis of the proposed methods is considered under suitable conditions. Since general variational inequalities include the variational inequalities, complementarity problems and nonlinear equations as special cases, our results continued to hold for these problems. The techniques and ideas of this paper be starting point for the future research. [ABSTRACT FROM AUTHOR]

This paper presents new results to fractional boundary value problems of the Caputo type with focal boundary conditions. This fractional derivative is used extensively in modelling real world applications. The main aim of this paper is to present results for the existence of solutions to ensure the usefulness in the context of modelling and providing a priori bounds on all possible solutions subject to a single versatile differential inequality. These results vastly expand the scope of problems which are applicable since it allows the fractional differential equation to have unrestricted growth and be nonlinear. [ABSTRACT FROM AUTHOR]

In this paper, the exponential convergence of delayed inertial Cohen-Grossberg neural networks (CGNNs) is studied. Two methods are adopted to discuss the inertial CGNNs, one is expressed as two first-order differential equations by selecting a variable substitution, and the other does not change the order of the system based on the nonreduced-order method. By establishing appropriate Lyapunov function and using inequality techniques, sufficient conditions are obtained to ensure that the discussed model converges exponentially to a ball with the prespecified convergence rate. Finally, two simulation examples are proposed to illustrate the validity of the theorem results. [ABSTRACT FROM AUTHOR]

In this paper, we suggest and analyze a viscosity implicit midpoint iterative method for a nonexpansive mapping in the framework of CAT(0) space. Further, under the some conditions, strong convergence theorem is proved by the sequence generated by the proposed iterative method, which, also solves the variational inequality problem. Further, the results presented in this paper may be treated as an extension and generalization of some corresponding ones in the literature. [ABSTRACT FROM AUTHOR]

The paper deals with a significant extension of the recently proposed class of relatively strongly convex optimization problems in spaces of large dimension. In the present paper, we introduce an analog of the concept of relative strong convexity for variational inequalities (relative strong monotonicity) and study estimates for the rate of convergence of some numerical first-order methods for problems of this type. The paper discusses two classes of variational inequalities depending on the conditions related to the smoothness of the operator. The first of these classes of problems contains relatively bounded operators, and the second, operators with an analog of the Lipschitz condition (known as relative smoothness). For variational inequalities with relatively bounded and relatively strongly monotone operators, a version of the subgradient method is studied and an optimal estimate for the rate of convergence is justified. For problems with relatively smooth and relatively strongly monotone operators, we prove the linear rate of convergence of an algorithm with a special organization of the restart procedure of a mirror prox method for variational inequalities with monotone operators. [ABSTRACT FROM AUTHOR]

The aim of this note is to put straight the inaccuracy in Theorem 1 of the paper mentioned in the title (J. Math. Ineq. 13 (4), 1011-1022). The inaccuracy was due to an omission of a factor in the proof of the theorem. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of finding a solution of a pseudomonotone variational inequality problem with the constraints of fixed points of a finite family of demicontractive multivalued mappings. We introduce a new generalized viscosity inertial Tseng's extragradient method which uses self-adaptive step sizes. Unlike some existing results in this direction, we prove our strong convergence theorems without the sequentially weakly continuity condition of the pseudomonotone operator and without the knowledge of Lipschitz constants. Moreover, our strong convergence results do not follow the conventional "two cases" approach, which was often employed in proving strong convergence. Finally, we apply our result to convex minimization problems and present several numerical experiments to illustrate the performance of the proposed algorithms in comparison with other existing methods in the literature. [ABSTRACT FROM AUTHOR]

In order to approximate the common solution of quasi-nonexpansive fixed point and pseudo-monotone variational inequality problems in real Hilbert spaces, this paper presented three new modified sub-gradient extragradient-type methods. Our algorithms incorporated viscosity terms and double inertial extrapolations to ensure strong convergence and to speed up convergence. No line search methods of the Armijo type were required by our algorithms. Instead, they employed a novel self-adaptive step size technique that produced a non-monotonic sequence of step sizes while also correctly incorporating a number of well-known step sizes. The step size was designed to lessen the algorithms' reliance on the initial step size. Numerical tests were performed, and the results showed that our step size is more effective and that it guarantees that our methods require less execution time. We stated and proved the strong convergence of our algorithms under mild conditions imposed on the control parameters. To show the computational advantage of the suggested methods over some wellknown methods in the literature, several numerical experiments were provided. To test the applicability and efficiencies of our methods in solving real-world problems, we utilized the proposed methods to solve optimal control and image restoration problems. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to investigate a Bregman projection algorithm for solving the split variational inequality problem governed by pseudomonotone and not necessarily Lipschitz continuous operators in real Hilbert spaces. The proposed algorithm is motivated by the ideas of the Halpern method, the CQ method, and Tseng's extragradient method. The step size sequences are determined by employing Armijo line search techniques. The strong convergence theorem is established without the prior knowledge of the operator norm and the Lipschitz continuous assumption on the operators involved. Some numerical experiments with graphical illustrations are presented to demonstrate the effectiveness and the performance of our proposed algorithm in comparison with some existing ones. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and study a viscous-type extrapolation algorithm for finding a solution of the variational inequality problem and a fixed point constraint of quasi-nonexpansive mappings under the scope of real Hilbert spaces when the underlying cost operator is quasi-monotone. The method involves inertial viscosity approximation and a constructed self-adjustable step size condition that depends solely on the information of the previous step. We establish a strong convergence result of the proposed method under certain mild conditions on the algorithm parameters. Finally, to demonstrate the gain of our method, some numerical examples are presented in comparison with some related methods in literature. [ABSTRACT FROM AUTHOR]

In this paper, we provide necessary and sufficient conditions for the existence of solutions for variational inequalities and sufficient conditions for the existence of solutions for quasi-Ky Fan minimax inequality, quasi-variational inequalities, and generalized variational inequalities. As applications, we apply these results to derive existence results for strong Nash equilibria in generalized games which generalize some existence theorems for Nash equilibria in generalized games in the literature and the existence theorem for strong Nash equilibria in normal-form games by Nessah and Tian [J. Math. Anal. Appl. 414 (2014), 871-885]. We also provide sufficient conditions for the uniqueness of strong Nash equilibria in certain generalized games. [ABSTRACT FROM AUTHOR]

This paper proves an equality for the case of twice-differentiable convex functions involving conformable fractional integrals. Using the established equality, we give new Simpson-type inequalities for the case of twice-differentiable convex functions via conformable fractional integrals. We also consider some special cases which can be deduced from the main results. [ABSTRACT FROM AUTHOR]

In this paper, we consider a class of stochastic BAM neural networks with delays. By establishing new integral inequalities and using the properties of spectral radius of nonnegative matrix, some sufficient conditions for the existence and global p-exponential stability of periodic solution for stochastic BAM neural networks with delays are given. An example is provided to show the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we establish the existence of extremals for the Trudinger–Moser functional under the weighted Sobolev norm involved with the trapping potential. Since the trapping potential is non-radial, possible extremals of the Trudinger–Moser functional do not have to be radially symmetric. As a result, one can't expect to apply the symmetrization argument to obtain the existence of extremal functions for these inequalities. Thus, the standard blow-up analysis relying on the symmetrization argument no longer works. In this paper, we will develop a new symmetrization-free approach to establish the existence of an extremal (Theorem 1.1) We first show that if the maximizing sequence does not converge strongly to an extremal function, then it must be a concentration or vanishing sequence through excluding the dichotomy phenomenon (see Lemma 2.9). Since the vanishing or concentration sequence may not be radially symmetric, this causes much challenge to exclude the vanishing or concentration phenomenon of the maximizing sequence. Then the elimination of the vanishing phenomenon can be done by comparing the supremums of the Trudinger–Moser functional under the constraint of the classical Sobolev norm (i.e., S ∞ (α) ) and weighted Sobolev norm associated with the potential (i.e., S (V , α) ) respectively. For the elimination of the concentration phenomenon of the maximizing sequence, we will develop the blow-up analysis procedure for the non-radial maximizing sequence. Furthermore, we also study the existence of extremals for the perturbed Trudinger–Moser inequality in R 2 involved with trapping potential (see Theorem 1.3). While an extremal function of the classical Trudinger–Moser and the perturbed Trudinger–Moser inequality does not exist in some situations, surprisingly, the supremum of the Trudinger–Moser and the perturbed Trudinger–Moser functional involved with the trapping potential can always be achieved. [ABSTRACT FROM AUTHOR]

In this paper, a new version of a higher-order strongly convex function is introduced which is named (ω-σ)-higherorder strongly convex function. Sufficient conditions for the existence of minimum for (ω - σ)-higher order strongly convex function is provided. The vector version of (ω-σ)-higher order strongly convex function is given and by using KKM theory an existence results for a solution of it is proved. Moreover, the compactness of the solution set of the vector version of (ω -σ)-higher order strongly convex function is investigated. The results of this article improve and extend the corresponding results presented in this area. [ABSTRACT FROM AUTHOR]

In this paper, we consider a mathematical model which describes the equilibrium of two elastic rods attached to a nonlinear spring. We derive the variational formulation of the model which is in the form of an elliptic quasivariational inequality for the displacement field. We prove the unique weak solvability of the problem, then we state and prove some convergence results, for which we provide the corresponding mechanical interpretation. Next, we turn to the numerical approximation of the problem based on a finite element scheme. We use a relaxation method to solve the discrete problems that we implement on the computer. Using this method, we provide numerical simulations which validate our convergence results. [ABSTRACT FROM AUTHOR]

In this paper, we mainly introduce a new algorithm with a different line-search process for solving variational inequality problem of pseudomonotone and non-Lipschitz operators in real Hilbert spaces. Under some appropriate restrictions imposed on the parameters, we prove a strong convergence theorem for finding an element of solutions of variational inequality problem. At the same time, we give some numerical examples to illustrate the effectiveness of our proposed algorithm. The main results obtained in this paper extend and improve many recent ones in the literature. [ABSTRACT FROM AUTHOR]

s t r i n g U t i l s. c o n v e r t A b s t r a c t M a t h H t m l (formulaUtilTools.convertMathHtml( s t r i n g U t i l s. c o n v e r t M m l (!article.abstractinfoEn)),'en') Compared to the standard variational inequalities, inverse variational inequalities are more suitable for pricing American options with indefinite payoff. This paper investigated the initial-boundary value problem of inverse variational inequalities constituted by a class of non-divergence type parabolic operators. We established the existence and Hölder continuity of weak solutions. Since the comparison principle in the case of standard variational inequalities is no longer applicable, we constructed an integral inequality using differential inequalities to determine the global upper bound of the solution. By combining it with the continuous method, we obtained the existence of weak solutions. Additionally, by employing truncation factors, we obtained the lower bound of weak solutions in the cylindrical subdomain, thereby obtaining the Hölder continuity. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose an inertial-type AA-viscosity algorithm for approximating the common solutions of the split variational inclusion problem, the generalized equilibrium problem and the common fixed-point problem of nonexpansive mappings. The strong convergence of an iterative sequence obtained through the proposed method is proved under some mild assumptions. Consequently, approximations of the solution of the split feasibility problem, the relaxed split feasibility problem, the split common null point problem and the split minimization problem are given. The applicability of our proposed algorithm has been illustrated with the help of a numerical example. Our iterative method was then compared graphically with different comparable methods in the existing literature. [ABSTRACT FROM AUTHOR]

In this paper, a self-adaptive algorithm involving inertial technique will be introduced to solve bilevel pseudo-monotone variational inequality problems in Hilbert spaces. The main advantages of our algorithm is that the strong convergence theorem of the stated iterative method is proved without Lipschitz continuity condition of the associated mapping. Finally, the effectiveness and superiority of the proposed algorithm are proposed by numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper, two generalized algorithms for solving the variational inequality problem in Banach spaces are proposed. Then the strong convergence of the sequences generated by these algorithms will be proved under suitable conditions. Finally, using MATLAB software, we provide some numerical examples to illustrate our results. [ABSTRACT FROM AUTHOR]

Based on the time-fractional Black-Scholes pricing model, the evaluation of an American-style option problem can be formulated as a free boundary problem. It is equivalent to a time-fractional parabolic variational inequality. Due to the time-fractional derivative involved in the problem, increasing the computational cost for large final times has been expected in the numerical solution for this problem. In this paper, we want to propose a new adaptive numerical method to solve this problem accurately, with low computational cost. The presented method is based on interpolating wavelets family. An adaptive scheme in time discretization with an adaptive wavelet collocation method for space discretization has been used for the given problem. We show that combination of interpolating wavelet basis and finite difference method, makes an accurate structure to design an optimal adaptive mesh for this problem. The presented computational mesh by this method can prevent growing of computational cost by time. The performance of the proposed method has been tested by means of some numerical experiments. We show that, in comparison with the full grid algorithms, the presented adaptive algorithm can capture the priori unknown free boundary and is able to find the value of American put option price with high accuracy and reasonable CPU time. [ABSTRACT FROM AUTHOR]

This paper deals with a class of inertial gradient projection methods for solving a variational inequality problem involving pseudomonotone and non-Lipschitz mappings in Hilbert spaces. The proposed algorithm incorporates inertial techniques and the projection and contraction method. The weak convergence is proved without the condition of the Lipschitz continuity of the mappings. Meanwhile, the linear convergence of the algorithm is established under strong pseudomonotonicity and Lipschitz continuity assumptions. The main results obtained in this paper extend and improve some related works in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we consider classes of approximate Minty and Stampacchia type vector variational inequalities using Clarke subdifferential on Hadamard manifolds and a class of nonsmooth multiobjective optimization problems. We investigate the relationship between the solution of these approximate vector variational inequalities and the solution of nonsmooth multiobjective optimization problems involving geodesic approximately convex functions. The results presented in this paper extend and generalize some existing results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new modified inertial Mann-type method that combines the subgradient extragradient method with the projection contraction method for solving quasimonotone variational inequality problems and fixed point problems in real Hilbert spaces. We establish strong convergence of the proposed method under some mild conditions without knowledge of the operator norm. Finally, we give numerical experiments to illustrate the efficiency of the method over the existing one in the literature. [ABSTRACT FROM AUTHOR]

This paper introduces two new variational properties, robust and continuous metric subregularity, for finite linear inequality systems under data perturbations. The motivation of this study goes back to the seminal work by Dontchev, Lewis, and Rockafellar (2003) on the radius of metric regularity. In contrast to the metric regularity, the unstable continuity behavoir of the (always finite) metric subregularity modulus leads us to consider the aforementioned properties. After characterizing both of them, the radius of robust metric subregularity is computed and some insights on the radius of continuous metric subregularity are provided. [ABSTRACT FROM AUTHOR]

This paper is devoted to study of a class of conformally at (α, β)- metrics that have of the form F = α exp(2s)=s; where s:= βα. They are called Kropina change of exponential (α, β)-metrics. We prove that if F has relatively isotropic mean Landsberg curvature or almost vanishing Ξ-curvature then it is a Riemannian metric or a locally Minkowski metric. Also, we prove that, if F be a weak Einstein metric, then it is either a Riemannian metric or a locally Minkowski metric. [ABSTRACT FROM AUTHOR]

In this paper, we propose an inertial shrinking Tseng's extragradient algorithm with a self-adaptive step size for solving pseudomonotone variational inequality problem with non-Lipschitz operators in the framework of 2-uniformly convex Banach spaces which are also uniformly smooth. Moreover, we prove a strong convergence result for the proposed algorithm under mild conditions on the control parameters. The main advantages of our algorithm are: our proposed algorithm solves the variational inequality problem with a larger class of mappings (pseudomonotone and non-Lipschitz operators); unlike the existing results in the literature, our algorithm does not require any linesearch technique even while the operator is non-Lipschitz; minimized number of projections per iteration compared to related results in the literature; and the inertial technique employed which speeds up the rate of convergence. Finally, we present some numerical examples to illustrate the efficiency of our algorithm in comparison with related methods in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we propose a Mann type self-adaptive Tseng's extragradient method for solving the classical variational inequality problem with a Lipschitz continuous and quasi-monotone mapping in a real Hilbert space. The strong convergence of the proposed algorithm is proven without the prior knowledge of the Lipschitz constant of the corresponding function. Finally, we give some numerical examples to illustrate the superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a forward-backward-forward splitting algorithm with double inertial effects to approximate a solution of a non-convex mixed variational inequality problem. Our algorithm does not involve an on-line rule and one of the inertial factors is chosen to be non-positive. We give global convergence results of the iterative sequence generated by our algorithm. Some known results are recovered as special cases of our results. Numerical test is given to support the theoretical findings. [ABSTRACT FROM AUTHOR]

In this paper, quasi-statical boundary contact problems of couple-stress viscoelasticity for inhomogeneous anisotropic bodies with regard to friction are investigated. We prove the uniqueness theorem of weak solutions using the corresponding Green's formulas and positive definiteness of the potential energy. To analyze the existence of solutions, we equivalently reduce the problem under consideration to a spatial variational inequality. We consider a special parameter-dependent regularization of this variational inequality which is equivalent to the relevant regularized variational equation depending on a real parameter, and study its solvability by the Galerkin approximate method. Some a priori estimates for solutions of the regularized variational equation are established and with the help of an appropriate limiting procedure, the existence theorem for the original contact problem with friction is proved. [ABSTRACT FROM AUTHOR]