. In this article, we consider the problem of approximating the solution of bilevel split variational inequality problem in real Hilbert spaces. The underlying operators in the lower level problem are quasimonotone and Lipschitz continuous. The proposed algorithm is a combination of the modified subgradient extragradient and modified Tseng's extragradient methods. Compared with the existing modified subgragadient extragradient methods for solving bilevel split variational inequality problem, our suggested method does not required computation of the projections onto two half-spaces, containing the feasibility sets. The step sizes employed in our algorithm do not need the prior knowledge of the norm of the bounded linear operator and the the Lipschitz constants of the underlying operators. We obtain the strong convergence results of the new method using some mild conditions on the control parameters. The proposed method involves double inertial terms which permits it to accelerate its convergence speed. To show the advantage and potential of our method over some existing methods, we present some numerical experiments. direction.
. This paper establishes sufficient optimality conditions for nonlinear continuous-time optimization problems using the concept of second-order KKT-invexity. Second-order KKT-invexity is a type of generalized convexity that is appropriate to work with second-order stationary solutions, which in turn are solutions that satisfy second-order necessary optimality conditions. It is shown that the second-order necessary optimality conditions become sufficient for problems satisfying this generalized convexity concept. Furthermore, it is shown that in some cases this concept is the most general, in the sense that if the problem is such that every second-order stationary solution is an optimal solution, then the problem necessarily satisfies the generalized convexity concept.
