scholarly journals ρ-PROJECTIVE AND σ-INVOLUNTARY VARIATIONAL INEQUALITIES AND IMPROVED PROJECTION METHOD FOR PROJECTED DYNAMICAL SYSTEM

2021 ◽  
Vol 9 (2) ◽  
pp. 18-24
Author(s):  
Siddharth Mitra ◽  
Prasanta Kumar Das
Keyword(s):  
Dynamical System ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Gradient Method ◽  
Initial Value Problem ◽  
Equivalence Theorem ◽  
Variational Inequality Problems ◽  
Initial Value ◽  
Type Method ◽  
The Given

Purpose of study: To introduce the concept of projective and involuntary variational inequality problems of order  and  respectively. To study the equivalence theorem between these problems. To study the projected dynamical system using self involutory variational inequality problems. Methodology: Improved extra gradient method is used. Main Finding: Using a self-solvable improved extra gradient method we solve the variational inequalities. The algorithm of the projected dynamical system is provided using the RK-4 method whose equilibrium point solves the involutory variational inequality problems. Application of this study: Runge-Kutta type method of order 2 and 4 is used for the initial value problem with the given projected dynamical system with the help of self involutory variational inequality problems. The originality of this study:  The concept of self involutory variational inequality problems, projective and involuntary variational inequality problems of order  and  respectively are newly defined.

scholarly journals Quasilinearization of the Initial Value Problem for Difference Equations with “Maxima”

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
S. Hristova ◽  
A. Golev ◽  
K. Stefanova
Keyword(s):  
Difference Equation ◽  
Difference Equations ◽  
Initial Value Problem ◽  
Linear Difference Equation ◽  
Successive Approximations ◽  
Time Interval ◽  
Initial Value ◽  
Past Time ◽  
The Given ◽  
Unknown Solution

The object of investigation of the paper is a special type of difference equations containing the maximum value of the unknown function over a past time interval. These equations are adequate models of real processes which present state depends significantly on their maximal value over a past time interval. An algorithm based on the quasilinearization method is suggested to solve approximately the initial value problem for the given difference equation. Every successive approximation of the unknown solution is the unique solution of an appropriately constructed initial value problem for a linear difference equation with “maxima,” and a formula for its explicit form is given. Also, each approximation is a lower/upper solution of the given mixed problem. It is proved the quadratic convergence of the successive approximations. The suggested algorithm is realized as a computer program, and it is applied to an example, illustrating the advantages of the suggested scheme.

scholarly journals A class of nonlinear variational inequalities involving pseudomonotone operators

2000 ◽  
Vol 13 (1) ◽  
pp. 73-75
Author(s):  
Ram U. Verma
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Monotone Operators ◽  
Variational Inequality Problems ◽  
Vector Spaces ◽  
Pseudomonotone Operators ◽  
Topological Vector Spaces ◽  
Locally Convex

We present the solvability of a class of nonlinear variational inequalities involving pseudomonotone operators in a locally convex Hausdorff topological vector spaces setting. The obtained result generalizes similar variational inequality problems on monotone operators.

A new self adaptive Tseng’s extragradient method with double-projection for solving pseudomonotone variational inequality problems in Hilbert spaces

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Zhongbing Xie ◽  
Gang Cai ◽  
Xiaoxiao Li ◽  
Qiao-Li Dong
Keyword(s):  
Variational Inequality ◽  
Variational Inequalities ◽  
Strong Convergence ◽  
Hilbert Spaces ◽  
Convergence Theorem ◽  
Numerical Experiments ◽  
Extragradient Method ◽  
Variational Inequality Problems ◽  
Strong Convergence Theorem ◽  
Tseng’S Extragradient Method

Abstract The purpose of this paper is to study a new Tseng’s extragradient method with two different stepsize rules for solving pseudomonotone variational inequalities in real Hilbert spaces. We prove a strong convergence theorem of the proposed algorithm under some suitable conditions imposed on the parameters. Moreover, we also give some numerical experiments to demonstrate the performance of our algorithm.

scholarly journals Vector and Ordered Variational Inequalities and Applications to Order-Optimization Problems on Banach Lattices

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Linsen Xie ◽  
Jinlu Li ◽  
Wenshan Yang
Keyword(s):  
Fixed Point ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Fixed Point Theorems ◽  
Optimization Problems ◽  
Banach Lattices ◽  
Variational Inequality Problems ◽  
Vector Spaces ◽  
Real Vector ◽  
Finite Dimensional

We investigate the connections between vector variational inequalities and ordered variational inequalities in finite dimensional real vector spaces. We also use some fixed point theorems to prove the solvability of ordered variational inequality problems and their application to some order-optimization problems on the Banach lattices.

scholarly journals Monotone-Iterative Method for the Initial Value Problem with Initial Time Difference for Differential Equations with “Maxima”

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
S. Hristova ◽  
A. Golev
Keyword(s):  
Differential Equations ◽  
Initial Value Problem ◽  
Upper And Lower Solutions ◽  
Successive Approximations ◽  
Initial Time ◽  
Time Interval ◽  
Monotone Iterative Method ◽  
Initial Value ◽  
Monotone Iterative ◽  
The Given

The object of investigation of the paper is a special type of functional differential equations containing the maximum value of the unknown function over a past time interval. An improved algorithm of the monotone-iterative technique is suggested to nonlinear differential equations with “maxima.” The case when upper and lower solutions of the given problem are known at different initial time is studied. Additionally, all initial value problems for successive approximations have both initial time and initial functions different. It allows us to construct sequences of successive approximations as well as sequences of initial functions, which are convergent to the solution and to the initial function of the given initial value problem, respectively. The suggested algorithm is realized as a computer program, and it is applied to several examples, illustrating the advantages of the suggested scheme.

Sign in / Sign up

Export Citation Format

Share Document