• Title/Summary/Keyword: Tseng extragradient method

Search Result 5, Processing Time 0.019 seconds

HALPERN TSENG'S EXTRAGRADIENT METHODS FOR SOLVING VARIATIONAL INEQUALITIES INVOLVING SEMISTRICTLY QUASIMONOTONE OPERATOR

  • Wairojjana, Nopparat;Pakkaranang, Nuttapol
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.1
    • /
    • pp.121-140
    • /
    • 2022
  • In this paper, we study the strong convergence of new methods for solving classical variational inequalities problems involving semistrictly quasimonotone and Lipschitz-continuous operators in a real Hilbert space. Three proposed methods are based on Tseng's extragradient method and use a simple self-adaptive step size rule that is independent of the Lipschitz constant. The step size rule is built around two techniques: the monotone and the non-monotone step size rule. We establish strong convergence theorems for the proposed methods that do not require any additional projections or knowledge of an involved operator's Lipschitz constant. Finally, we present some numerical experiments that demonstrate the efficiency and advantages of the proposed methods.

ON STRONG CONVERGENCE THEOREMS FOR A VISCOSITY-TYPE TSENG'S EXTRAGRADIENT METHODS SOLVING QUASIMONOTONE VARIATIONAL INEQUALITIES

  • Wairojjana, Nopparat;Pholasa, Nattawut;Pakkaranang, Nuttapol
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.2
    • /
    • pp.381-403
    • /
    • 2022
  • The main goal of this research is to solve variational inequalities involving quasimonotone operators in infinite-dimensional real Hilbert spaces numerically. The main advantage of these iterative schemes is the ease with which step size rules can be designed based on an operator explanation rather than the Lipschitz constant or another line search method. The proposed iterative schemes use a monotone and non-monotone step size strategy based on mapping (operator) knowledge as a replacement for the Lipschitz constant or another line search method. The strong convergences have been demonstrated to correspond well to the proposed methods and to settle certain control specification conditions. Finally, we propose some numerical experiments to assess the effectiveness and influence of iterative methods.

A NEW EXPLICIT EXTRAGRADIENT METHOD FOR SOLVING EQUILIBRIUM PROBLEMS WITH CONVEX CONSTRAINTS

  • Muangchoo, Kanikar
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.1
    • /
    • pp.1-22
    • /
    • 2022
  • The purpose of this research is to formulate a new proximal-type algorithm to solve the equilibrium problem in a real Hilbert space. A new algorithm is analogous to the famous two-step extragradient algorithm that was used to solve variational inequalities in the Hilbert spaces previously. The proposed iterative scheme uses a new step size rule based on local bifunction details instead of Lipschitz constants or any line search scheme. The strong convergence theorem for the proposed algorithm is well-proven by letting mild assumptions about the bifunction. Applications of these results are presented to solve the fixed point problems and the variational inequality problems. Finally, we discuss two test problems and computational performance is explicating to show the efficiency and effectiveness of the proposed algorithm.

A VISCOSITY TYPE PROJECTION METHOD FOR SOLVING PSEUDOMONOTONE VARIATIONAL INEQUALITIES

  • Muangchoo, Kanikar
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.2
    • /
    • pp.347-371
    • /
    • 2021
  • A plethora of applications from mathematical programmings, such as minimax, mathematical programming, penalization and fixed point problems can be framed as variational inequality problems. Most of the methods that used to solve such problems involve iterative methods, that is why, in this paper, we introduce a new extragradient-like method to solve pseudomonotone variational inequalities in a real Hilbert space. The proposed method has the advantage of a variable step size rule that is updated for each iteration based on previous iterations. The main advantage of this method is that it operates without the previous knowledge of the Lipschitz constants of an operator. A strong convergence theorem for the proposed method is proved by letting the mild conditions on an operator 𝒢. Numerical experiments have been studied in order to validate the numerical performance of the proposed method and to compare it with existing methods.

APPROXIMATE PROJECTION ALGORITHMS FOR SOLVING EQUILIBRIUM AND MULTIVALUED VARIATIONAL INEQUALITY PROBLEMS IN HILBERT SPACE

  • Khoa, Nguyen Minh;Thang, Tran Van
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.4
    • /
    • pp.1019-1044
    • /
    • 2022
  • In this paper, we propose new algorithms for solving equilibrium and multivalued variational inequality problems in a real Hilbert space. The first algorithm for equilibrium problems uses only one approximate projection at each iteration to generate an iteration sequence converging strongly to a solution of the problem underlining the bifunction is pseudomonotone. On the basis of the proposed algorithm for the equilibrium problems, we introduce a new algorithm for solving multivalued variational inequality problems. Some fundamental experiments are given to illustrate our algorithms as well as to compare them with other algorithms.