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.

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.

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.

EXISTENCE RESULTS FOR A CLASS OF PSEUDOMONOTONE ELLIPTIC-PARABOLIC INCLUSIONS

This paper deals with the initial-value problem of nonlinear evolution inclusions of the form dB（u）/dt ＋ A（u） f, v0 ∈ B（u）（0）, where the operator B is induced by a subgradient and A is pseudomonotone. Existence theorem is established via the time discretization technique and the regularization method. In contrast to the previous results, here we impose a weaker coerciveness condition on A and remove the strong monotonicity from B.

STRONG CONVERGENCE OF AN INERTIAL EXTRAGRADIENT METHOD WITH AN ADAPTIVE NONDECREASING STEP SIZE FOR SOLVING VARIATIONAL INEQUALITIES

In this work,we investigate a classical pseudomonotone and Lipschitz continuous variational inequality in the setting of Hilbert space,and present a projection-type approximation method for solving this problem.Our method requires only to compute one projection onto the feasible set per iteration and without any linesearch procedure or additional projections as well as does not need to the prior knowledge of the Lipschitz constant and the sequentially weakly continuity of the variational inequality mapping.A strong convergence is established for the proposed method to a solution of a variational inequality problem under certain mild assumptions.Finally,we give some numerical experiments illustrating the performance of the proposed method for variational inequality problems.

ON NONLINEAR ELLIPTIC HEMIVARIATIONAL INEQUALITIES OF SECOND ORDER

In this paper, a nonlinear hemivariational inequality of second order with a forcing term of subcritical growth is studied. Using techniques from multivalued analysis and the theory of nonlinear operators of monotone type, an existence theorem for the Dirichlet boundary value problem is proved.

The Equivalence about Strongly Pseudoinvexity and Strongly Invariant Pseudomonotonicity

In this paper, the equivalence is established about strongly pseudoinvexity of function and invariant pseudomonotonicity of corresponding gradient map under some suitable conditions.

Existence of Solutions to a Generalized System

In this paper, we introduce a generalized system (for short, GS) in real Banach spaces. Using Brouwer’s fixed point theorem, we establish some existence theorems for the generalized system without monotonicity. Further, we extend the concept of C-strong pseudomonotonicity and extend Minty’s lemma for the generalized system. And using the Minty lemma and KKM-Fan lemma, we establish an existence theorem for the generalized system with monotonicity in real reflexive Banach spaces. As the continuation of existing studies, our paper present a series of extended results based on existing corresponding results.

Subgradient Extragradient Methods for Equilibrium Problems and Fixed Point Problems in Hilbert Space

Inspired by inertial methods and extragradient algorithms,two algorithms were proposed to investigate fixed point problem of quasinonexpansive mapping and pseudomonotone equilibrium problem in this study.In order to enhance the speed of the convergence and reduce computational cost,the algorithms used a new step size and a cutting hyperplane.The first algorithm was proved to be weak convergence,while the second algorithm used a modified version of Halpern iteration to obtain strong convergence.Finally,numerical experiments on several specific problems and comparisons with other algorithms verified the superiority of the proposed algorithms.

Modified Subgradient Extragradient Method for Pseudomonotone Variational Inequalities

Many approaches have been put forward to resolve the variational inequality problem. The subgradient extragradient method is one of the most effective. This paper proposes a modified subgradient extragradient method about classical variational inequality in a real Hilbert interspace. By analyzing the operator’s partial message, the proposed method designs a non-monotonic step length strategy which requires no line search and is independent of the value of Lipschitz constant, and is extended to solve the problem of pseudomonotone variational inequality. Meanwhile, the method requires merely one map value and a projective transformation to the practicable set at every iteration. In addition, without knowing the Lipschitz constant for interrelated mapping, weak convergence is given and R-linear convergence rate is established concerning algorithm. Several numerical results further illustrate that the method is superior to other algorithms.

Pseudomonotonicity of Nonlinear Transformations on Euclidean Jordan Algebras

In this paper, we have introduced the concepts of pseudomonotonicity properties for nonlinear transformations defined on Euclidean Jordan algebras. The implications between this property and other P-properties have been studied. More importantly, we have solved the solvability problem of the nonlinear pseudomonotone complementarity problems over symmetric cones.

A New Self Adaptive Inertial Subgradient Extragradient Iterative Algorithm for Solving Variational Inequalities of Pseudomonotone Mappings in Real Hilbert Spaces

The main purpose of this paper is to introduce and deal with a self adaptive inertial subgradient extragradient iterative algorithm with a new and interesting stepsize rule in real Hilbert spaces.Under some proper control conditions imposed on the coefficients and operators,we prove a new strong convergence result for solving variational inequalities with regard to pseudomonotone and Lipschitzian operators.Moreover,some numerical simulation results are given to show the rationality and validity of our algorithm.

Optimal Controls of Nonlinear Evolution Inclusions withPseudomonotone Operator

In this paper, we study the optimal control problem of nonlinear differentialinclusions with principle operator being pseudomonotone. First, we give some propertiesof solutions of certain evolution equations. Further, we prove the existence of admissibletrajectories for evolution inclusions. Then, we extend the Fillipov's selection theoremand discuss a general Lagrange type optimal control problem. Finally, we present anexample that demonstrates the appplicability of our results.

Second Order Nonlinear Evolution Inclusions Existence and Relaxation Results

This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x（t） and x（t）. In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 （T, H）. Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 （T, H） to the solutions of the original convex problem （strong relaxation）. An example of a nonlinear hyperbolic optimal control problem is also discussed.

A Cutting Hyperplane Projection Method for Solving Generalized Quasi-Variational Inequalities

The generalized quasi-variational inequality is a generalization of the generalized variational inequality and the quasi-variational inequality.The study for the generalized quasi-variational inequality is mainly concerned with the solution existence theory.In this paper,we present a cutting hyperplane projection method for solving generalized quasi-variational inequalities.Our method is neweven if it reduces to solve the generalized variational inequalities.The global convergence is proved under certain assumptions.Numerical experiments have shown that our method has less total number of iterative steps than the most recent projection-like methods of Zhang et al.(Comput Optim Appl 45:89–109,2010)for solving quasi-variational inequality problems and outperforms the method of Li and He(J Comput Appl Math 228:212–218,2009)for solving generalized variational inequality problems.