Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems
From MaRDI portal
(Redirected from Publication:2043907)
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.
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
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A modified inertial subgradient extragradient method for solving variational inequalities
- A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
- A new inertial double-projection method for solving variational inequalities
- A new low-cost double projection method for solving variational inequalities
- An efficient iterative method for finding common fixed point and variational inequalities in Hilbert spaces
- An efficient projection-type method for monotone variational inequalities in Hilbert spaces
- Analysis of versions of relaxed inertial projection and contraction method
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- General splitting methods with linearization for the split feasibility problem
- Hybrid viscosity extragradient method for systems of variational inequalities, fixed points of nonexpansive mappings, zero points of accretive operators in Banach spaces
- Inertial projection and contraction algorithms for variational inequalities
- Inverse problems for quasi-variational inequalities
- Iterative Algorithms for Nonlinear Operators
- Iterative algorithms for solving fixed point problems and variational inequalities with uniformly continuous monotone operators
- Minimizing differences of convex functions with applications to facility location and clustering
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
- Nonsmooth variational inequalities on Hadamard manifolds
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- Self-adaptive inertial extragradient algorithms for solving variational inequality problems
- Some extragradient-viscosity algorithms for solving variational inequality problems and fixed point problems
- Strong convergence of inertial algorithms for solving equilibrium problems
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
- Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces
- Strong convergence result for monotone variational inequalities
- Weak convergence of iterative methods for solving quasimonotone variational inequalities
Cited in
(5)- Mann-type extragradient algorithm for solving variational inequality and fixed point problems
- 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
- Strong convergence of inertial extragradient algorithms for solving variational inequalities and 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)