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

2008 ◽  
Vol 23 (4) ◽  
pp. 463-474 ◽  
Author(s):  
Yun-juan Wang ◽  
De-tong Zhu
Keyword(s):  
Variational Inequality ◽  
Gradient Method ◽  
Variational Inequality Problem ◽  
Projected Gradient Method ◽  
Projected Gradient ◽  
Inequality Problem ◽  
Monotone Variational Inequality

scholarly journals On the $O(1/k)$ Convergence Rate of He's Alternating Directions Method for a Kind of Structured Variational Inequality Problem

2015 ◽  
Vol 7 (2) ◽  
pp. 69
Author(s):  
Haiwen Xu
Keyword(s):  
Variational Inequality ◽  
Convergence Rate ◽  
Variational Inequality Problem ◽  
Variational Inequality Problems ◽  
System Of Nonlinear Equations ◽  
Inequality Problem ◽  
Quadratic Minimization ◽  
Projection And Contraction Methods ◽  
Monotone Variational Inequality ◽  
Alternating Directions Method

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).

scholarly journals New Tseng-Degree Gradient Method in Variational Inequality Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Zhuang Shan ◽  
Lijun Zhu ◽  
Long He ◽  
Danfeng Wu ◽  
Haicheng Wei
Keyword(s):  
Hilbert Space ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
High Precision ◽  
Gradient Method ◽  
Variational Inequality Problem ◽  
Real Hilbert Space ◽  
Monotone Operators ◽  
Inequality Problem ◽  
Convergence Performance

This paper focuses on the problem of variational inequalities with monotone operators in real Hilbert space. The Tseng algorithm constructed by Thong replaced a high-precision step. Thus, a new Tseng-like gradient method is constructed, and the convergence of the algorithm is proved, and the convergence performance is higher.

scholarly journals Algorithms for Solving the Variational Inequality Problem over the Triple Hierarchical Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Thanyarat Jitpeera ◽  
Poom Kumam
Keyword(s):  
Fixed Point ◽  
Variational Inequality ◽  
Nonexpansive Mapping ◽  
Strong Convergence ◽  
Variational Inequality Problem ◽  
Strong Convergence Theorem ◽  
Fixed Point Set ◽  
Inequality Problem ◽  
Point Set ◽  
Monotone Variational Inequality

This paper discusses the monotone variational inequality over the solution set of the variational inequality problem and the fixed point set of a nonexpansive mapping. The strong convergence theorem for the proposed algorithm to the solution is guaranteed under some suitable assumptions.

Sign in / Sign up

Export Citation Format

Share Document