Weak and Strong Convergence of Self Adaptive Inertial Subgradient Extragradient Algorithms for Solving Variational Inequality Problems

Many solutions of variational inequalities have been proposed,among which the subgradient extragradient method has obvious advantages.Two different algorithms are given for solving variational inequality problem in this paper.The problem we study is defined in a real Hilbert space and has L-Lipschitz and pseudomonotone condition.Two new algorithms adopt inertial technology and non-monotonic step size rule,and their convergence can still be proved when the value of L is not given in advance.Finally,some numerical results are designed to demonstrate the computational efficiency of our two new algorithms.

Inertial Subgradient Extragradient Algorithm for Solving Variational Inequality Problems with Pseudomonotonicity

In order to solve variational inequality problems of pseudomonotonicity and Lipschitz continuity in Hilbert spaces, an inertial subgradient extragradient algorithm is proposed by virtue of non-monotone stepsizes. Moreover, weak convergence and R-linear convergence analyses of the algorithm are constructed under appropriate assumptions. Finally, the efficiency of the proposed algorithm is demonstrated through numerical implementations.

STRONGLY CONVERGENT INERTIAL FORWARD-BACKWARD-FORWARD ALGORITHM WITHOUT ON-LINE RULE FOR VARIATIONAL INEQUALITIES

This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.

QUASI-CONFORMING FINITE ELEMENT APPROXIMATION FOR A FOURTH ORDER VARIATIONAL INEQUALITY WITH DISPLACEMENT OBSTACLE

In this paper, unconventional quasi-conforming finite element approximation for a fourth order variational inequality with displacement obstacle is considered, the optimal order of error estimate O(h) is obtained which is as same as that of the conventional finite elements.

WEAK CONVERGENCE THEOREMS FOR GENERAL EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS IN BANACH SPACES

In this paper, we introduce two new iterative algorithms for finding a common element of the set of solutions of a general equilibrium problem and the set of solutions of the variational inequality for an inverse-strongly monotone operator and the set of common fixed points of two infinite families of relatively nonexpansive mappings or the set of common fixed points of an infinite family of relatively quasi-nonexpansive mappings in Banach spaces. Then we study the weak convergence of the two iterative sequences. Our results improve and extend the results announced by many others.

A FRACTIONAL NONLINEAR EVOLUTIONARY DELAY SYSTEM DRIVEN BY A HEMI-VARIATIONAL INEQUALITY IN BANACH SPACES

This article deals with a new fractional nonlinear delay evolution system driven by a hemi-variational inequality in a Banach space.Utilizing the KKM theorem,a result concerned with the upper semicontinuity and measurability of the solution set of a hemivariational inequality is established.By using a fixed point theorem for a condensing setvalued map,the nonemptiness and compactness of the set of mild solutions are also obtained for such a system under mild conditions.Finally,an example is presented to illustrate our main results.

An FEM approximation for a fourth-order variational inequality of second kind

A fourth-order variational inequality of the second kind arising in a plate frictional bending problem is considered. By using regularization method, the original problem can be formulated as a differentiable variational equation, and the corresponding discrete FEM variational equation is presented afterwards. Abstract error estimates and error estimates of the approximation are derived in terms of energy norm and L^2-norm.

BOUNDARY MIXED VARIATIONAL INEQUALITYIN FRICTION PROBLEM

In this paper, with the use of the friction problem in elasticity as the background, the existence and uniqueness for the solution of the nonlinear, indifferentiable mixed variational inequality are discussed. Its corresponding boundary variational inequality and the existence and uniqueness, of solution are given. This provides the theoretical basis for using boundary element method to solve the mixed variational inequality.

A Smoothing Newton Method for the Box Constrained Variational Inequality Problems

The box constrained variational inequality problem can be reformulated as a nonsmooth equation by using median operator.In this paper,we present a smoothing Newton method for solving the box constrained variational inequality problem based on a new smoothing approximation function.The proposed algorithm is proved to be well defined and convergent globally under weaker conditions.

A RELAXED INERTIAL FACTOR OF THE MODIFIED SUBGRADIENT EXTRAGRADIENT METHOD FOR SOLVING PSEUDO MONOTONE VARIATIONAL INEQUALITIES IN HILBERT SPACES

In this paper,we investigate pseudomonotone and Lipschitz continuous variational inequalities in real Hilbert spaces.For solving this problem,we propose a new method that combines the advantages of the subgradient extragradient method and the projection contraction method.Some very recent papers have considered different inertial algorithms which allowed the inertial factor is chosen in[0;1].The purpose of this work is to continue working in this direction,we propose another inertial subgradient extragradient method that the inertial factor can be chosen in a special case to be 1.Under suitable mild conditions,we establish the weak convergence of the proposed algorithm.Moreover,linear convergence is obtained under strong pseudomonotonicity and Lipschitz continuity assumptions.Finally,some numerical illustrations are given to confirm the theoretical analysis.

RELAXED INERTIAL METHODS FOR SOLVING SPLIT VARIATIONAL INEQUALITY PROBLEMS WITHOUT PRODUCT SPACE FORMULATION

Many methods have been proposed in the literature for solving the split variational inequality problem.Most of these methods either require that this problem is transformed into an equivalent variational inequality problem in a product space,or that the underlying operators are co-coercive.However,it has been discovered that such product space transformation may cause some potential difficulties during implementation and its approach may not fully exploit the attractive splitting nature of the split variational inequality problem.On the other hand,the co-coercive assumption of the underlying operators would preclude the potential applications of these methods.To avoid these setbacks,we propose two new relaxed inertial methods for solving the split variational inequality problem without any product space transformation,and for which the underlying operators are freed from the restrictive co-coercive assumption.The methods proposed,involve projections onto half-spaces only,and originate from an explicit discretization of a dynamical system,which combines both the inertial and relaxation techniques in order to achieve high convergence speed.Moreover,the sequence generated by these methods is shown to converge strongly to a minimum-norm solution of the problem in real Hilbert spaces.Furthermore,numerical implementations and comparisons are given to support our theoretical findings.

Existence and stability of solutions to inverse variational inequality problems

In this paper, two new existence and quasi-variational inequality problems are theorems of solutions to inverse variational proved using the Fan-Knaster-Kuratowski- Mazurkiewicz （KKM） theorem and the Kakutani-Fan-Glicksberg fixed point theorem. Upper semicontinuity and lower semicontinuity of the solution mapping and the approximate solution mapping to the parametric inverse variational inequality problem are also discussed under some suitable conditions. An application to a road pricing problem is given.

A NEW VARIATIONAL INEQUALITY FORMULATION FOR SEEPAGE PROBLEMS WITH FREE SURFACES

A new variational inequality formulation for seepage problems with free surfaces was presented, in which a boundary condition of (Signorini's) type was prescribed over the potential seepage surfaces. This made the singularity of seepage points eliminated and the location of seepage points determined. Compared to other variational formulations, the proposed formulation owns better numerical stability.

CONTACT PROBLEMS AND DUAL VARIATIONAL INEQUALITY OF 2－D ELASTOPLASTIC BEAM THEORY

In Order to study the frictional contact problems of the elastoplastic beam theory,an extended two-dimensional beam model is established, and a second order nonlinear equilibrium problem with both internal and external complementarity conditions is proposed. The external complementarity condition provides the free boundary condition. while the internal complemententarity condition gives the interface of the elastic and plastic regions. We prove that this bicomplementarity problem is equivalent to a nonlinear variational inequality The dual variational inequality is also developed.It is shown that the dual variational inequality is much easier than the primalvariational problem. Application to limit analysis is illustrated.

THE VARIATIONAL INEQUALITY FORMULATION FOR THE DEFORMATION THEORY IN PLASTICITY AND ITS NON-ITERATIVE SOLUTION

In this paper, the deformation theory in plasticity is formulated in the variational inequality, which can relax the constraint conditions of the constitutive equations. The new form makes the calculation more convenient than general energy forms and have reliable mathematical basis. Thus the plasticity theory may be solved by means of the quadratic programming instead of the iterative methods. And the solutions can be made in one step without any diversion of the load.

A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem

Based on a differentiable merit function proposed by Taji, et al in “Mathematical Programming, 1993, 58： 369-383”, a projected gradient trust region method for the monotone variational inequality problem with convex constraints is presented. Theoretical analysis is given which proves that the proposed algorithm is globally convergent and has a local quadratic convergence rate under some reasonable conditions. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.

Modified Subgradient Extragradient Method for Variational Inequality Problems and Fixed Point Problems

Many approaches inquiring into variational inequality problems have been put forward,among which subgradient extragradient method is of great significance.A novel algorithm is presented in this article for resolving quasi-nonexpansive fixed point problem and pseudomonotone variational inequality problem in a real Hilbert interspace.In order to decrease the execution time and quicken the velocity of convergence,the proposed algorithm adopts an inertial technology.Moreover,the algorithm is by virtue of a non-monotonic step size rule to acquire strong convergence theorem without estimating the value of Lipschitz constant.Finally,numerical results on some problems authenticate that the algorithm has preferable efficiency than other algorithms.

A Projection and Contraction Method for P-Order Cone Constraint Stochastic Variational Inequality Problem

In this paper, we study the p-order cone constraint stochastic variational inequality problem. We first take the sample average approximation method to deal with the expectation and gain an approximation problem, further the rationality is given. When the underlying function is Lipschitz continuous, we acquire a projection and contraction algorithm to solve the approximation problem. In the end, the method is applied to some numerical experiments and the effectiveness of the algorithm is verified.

Regularization Methods to Approximate Solutions of Variational Inequalities

In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y0, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.

A HYBRID METHOD FOR SOLVING VARIATIONAL INEQUALITY PROBLEMS

By using Fukushima's differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993.In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix Δ F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty,polyhedral,closed and convex is proposed.Armijo type line search and trust region strategies as well as Fukushima's differentiable merit function are incorporated into the method.It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al.,the method reduces to the basic Newton method and hence the rate of convergence is quadratic.Computational experiences show the efficiency of the proposed method.