Hybrid inertial contraction algorithms for solving variational inequalities with fixed point constraints in Hilbert spaces
type: Item
instance of: scholarly article
title: Hybrid inertial contraction algorithms for solving variational inequalities with fixed point constraints in Hilbert spaces
zbMATH Open document ID: 1502.65032
author: Yanyan Li
published in: Acta Mathematica Vietnamica
publication date: 2022-10-07T00:00:00Z
Mathematics Subject Classification ID: 65J99
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7597937
zbMATH Keywords: variational inequality problem
zbMATH Keywords: fixed point constraints
zbMATH Keywords: Lipschitz continuous
zbMATH Keywords: strongly monotone
zbMATH Keywords: forward-backward method
MaRDI profile type: Publication
full work available at URL: s40306-021-00467-6
OpenAlex ID: W4210718480
cites work: Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
cites work: A parallel subgradient method extended to variational inequalities involving nonexpansive mappings
cites work: New subgradient extragradient methods for solving monotone bilevel equilibrium problems
cites work: An extragradient algorithm for solving bilevel pseudomonotone variational inequalities
cites work: First-Order Methods in Optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
cites work: A parallel inertial S-iteration forward-backward algorithm for regression and classification problems
cites work: Weak and strong convergence of an inertial proximal method for solving Ky Fan minimax inequalities
cites work: A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings
cites work: A subgradient-type method for the equilibrium problem over the fixed point set and its applications
cites work: Q3905599
cites work: Combined relaxation methods for variational inequalities
cites work: Regularization of nonlinear ill-posed variational inequalities and convergence rates
cites work: An inertial forward-backward algorithm for monotone inclusions
cites work: Network design problem with congestion effects: A case of bilevel programming
cites work: Krasnoselski–Mann iteration for hierarchical fixed-point problems
cites work: On strong convergence by the hybrid method for families of mappings in Hilbert spaces
cites work: Approximation of zeros of inverse strongly monotone operators in Banach spaces
cites work: Q5296429
cites work: Neural networks for a class of bi-level variational inequalities
cites work: A modified Korpelevich's method convergent to the minimum-norm solution of a variational inequality
cites work: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings
cites work: Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
DOI: 10.1007/S40306-021-00467-6
description: scientific article; zbMATH DE number 7597937