Weak and strong convergence of inertial Tseng's extragradient algorithms for solving variational inequality problems

DOI10.1080/02331934.2020.1789129zbMath1467.49010OpenAlexW3041170790MaRDI QIDQ4999753

Xiaolong Qin, Jingjing Fan

Publication date: 2 July 2021

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1789129

zbMATH Keywords

convergencerelaxation algorithmvariational inequality probleminertial methodTseng's extragradient methodArmijo-like step size rule

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of reduced gradient type (90C52)

Related Items (max. 100)

Iterative algorithm with self-adaptive step size for approximating the common solution of variational inequality and fixed point problems ⋮ Modified subgradient extragradient algorithms with a new line-search rule for variational inequalities ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence analysis of an iterative algorithm for monotone operators
• Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Approximation of zeros of inverse strongly monotone operators in Banach spaces
• Algorithms for the split variational inequality problem
• On modified iterative method for nonexpansive mappings and monotone mappings
• iPiasco: inertial proximal algorithm for strongly convex optimization
• Modified Tseng's extragradient algorithms for variational inequality problems
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• Weak and strong convergence theorems for variational inequality problems
• An inertial method for solving split common fixed point problems
• Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
• Approximation of common solutions of variational inequalities via strict pseudocontractions
• A strong convergence theorem for Tseng's extragradient method for solving variational inequality problems
• Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
• Strong convergence theorem for uniformly L-Lipschitzian asymptotically pseudocontractive mapping in real Banach space
• Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
• Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
• A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
• STRONG CONVERGENCE ANALYSIS OF A HYBRID ALGORITHM FOR NONLINEAR OPERATORS IN A BANACH SPACE
• Projected Reflected Gradient Methods for Monotone Variational Inequalities
• Some methods of speeding up the convergence of iteration methods
• An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

This page was built for publication: Weak and strong convergence of inertial Tseng's extragradient algorithms for solving variational inequality problems