Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems
From MaRDI portal
Publication:2043907
DOI10.1007/S43036-021-00155-0zbMATH Open1494.47116arXiv2006.16615OpenAlexW3038570815MaRDI QIDQ2043907FDOQ2043907
Authors: Bing Tan, Jingjing Fan, Xiaolong Qin 
Publication date: 3 August 2021
Published in: Advances in Operator Theory (Search for Journal in Brave)
Abstract: The objective of this research is to explore a convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem. We introduce four inertial extragradient algorithms that are motivated by the inertial method, the subgradient extragradient method, the Tseng's extragradient method and the Mann-type method endowed with a simple step size. Strong convergence theorems of the algorithms are established under some standard and suitable conditions enforced by the cost operators. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.
Full work available at URL: https://arxiv.org/abs/2006.16615
Recommendations
- Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications
- Self-adaptive inertial extragradient algorithms for solving variational inequality problems
- Self adaptive viscosity-type inertial extragradient algorithms for solving variational inequalities with applications
- Modified inertial subgradient extragradient algorithms for variational inequalities and fixed point problems
- Modified inertial subgradient extragradient method with self adaptive stepsize for solving monotone variational inequality and fixed point problems
strong convergencefixed point problemvariational inequality problemsubgradient extragradient methodinertial methodTseng's extragradient method
Nonlinear programming (90C30) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- Iterative Algorithms for Nonlinear Operators
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
- Title not available (Why is that?)
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Strong convergence result for monotone variational inequalities
- Title not available (Why is that?)
- Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces
- Inverse problems for quasi-variational inequalities
- Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
- Inertial projection and contraction algorithms for variational inequalities
- Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
- Weak convergence of iterative methods for solving quasimonotone variational inequalities
- Self-adaptive inertial extragradient algorithms for solving variational inequality problems
- Analysis of versions of relaxed inertial projection and contraction method
- An efficient projection-type method for monotone variational inequalities in Hilbert spaces
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- A new low-cost double projection method for solving variational inequalities
- Strong convergence of inertial algorithms for solving equilibrium problems
- A new inertial double-projection method for solving variational inequalities
- An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces
- Nonsmooth variational inequalities on Hadamard manifolds
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- Minimizing differences of convex functions with applications to facility location and clustering
- A modified inertial subgradient extragradient method for solving variational inequalities
- Some extragradient-viscosity algorithms for solving variational inequality problems and fixed point problems
- General splitting methods with linearization for the split feasibility problem
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
Cited In (3)
- A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces
- A new class of inertial algorithms with monotonic step sizes for solving fixed point and variational inequalities
- Inertial KM-type extragradient scheme for solving a variational inequality and a hierarchical fixed point problems
This page was built for publication: Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043907)
