A projection and contraction method with adaptive step sizes for solving bilevel pseudo-monotone variational inequality problems

Optimization ◽  
2020 ◽  
pp. 1-24
Author(s):  
Duong Viet Thong ◽  
Xiao-Huan Li ◽  
Qiao-Li Dong ◽  
Yeol Je Cho ◽  
Themistocles M. Rassias
2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Ming Tian ◽  
Gang Xu

AbstractThe objective of this article is to solve pseudomonotone variational inequality problems in a real Hilbert space. We introduce an inertial algorithm with a new self-adaptive step size rule, which is based on the projection and contraction method. Only one step projection is used to design the proposed algorithm, and the strong convergence of the iterative sequence is obtained under some appropriate conditions. The main advantage of the algorithm is that the proof of convergence of the algorithm is implemented without the prior knowledge of the Lipschitz constant of cost operator. Numerical experiments are also put forward to support the analysis of the theorem and provide comparisons with related algorithms.


2015 ◽  
Vol 7 (2) ◽  
pp. 69
Author(s):  
Haiwen Xu

The  alternating directions method for a kind of structured variational inequality problem (He, 2001) is an attractive method for structured monotone variational inequality problems. In each iteration, the subproblemsare  convex quadratic minimization problem with simple constraintsand a well-conditioned system of nonlinear equations that can be efficiently solvedusing classical methods. Researchers have recently described the convergence rateof projection and contraction methods for variational inequality problems andthe original ADM and its linearized variant. Motivated and inspired by researchinto the convergence rate of these methods, we provide a simple proof to show the $O(1/k)$ convergencerate of  alternating directions methods for structured monotone variational inequality problems (He, 2001).


2004 ◽  
Vol 16 (4) ◽  
pp. 863-883 ◽  
Author(s):  
Youshen Xia

Recently, a projection neural network has been shown to be a promising computational model for solving variational inequality problems with box constraints. This letter presents an extended projection neural network for solving monotone variational inequality problems with linear and nonlinear constraints. In particular, the proposed neural network can include the projection neural network as a special case. Compared with the modified projection-type methods for solving constrained monotone variational inequality problems, the proposed neural network has a lower complexity and is suitable for parallel implementation. Furthermore, the proposed neural network is theoretically proven to be exponentially convergent to an exact solution without a Lipschitz condition. Illustrative examples show that the extended projection neural network can be used to solve constrained monotone variational inequality problems.


Sign in / Sign up

Export Citation Format

Share Document