On variable-step relaxed projection algorithm for variational inequalities
type: Item
instance of: scholarly article
title: On variable-step relaxed projection algorithm for variational inequalities
zbMATH Open document ID: 1056.49018
author: Qingzhi Yang
published in: Journal of Mathematical Analysis and Applications
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 2136277
zbMATH Keywords: variational inequality
zbMATH Keywords: weak co-coercivity
zbMATH Keywords: projection
zbMATH Keywords: relaxation
zbMATH Keywords: SFP
zbMATH Keywords: split feasibility problem
MaRDI profile type: Publication
full work available at URL: j.jmaa.2004.07.048
OpenAlex ID: W1965581979
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Inexact Newton methods for the nonlinear complementarity problem
cites work: Q4091727
cites work: An Outer Approximation Algorithm for Solving General Convex Programs
cites work: A relaxed projection method for variational inequalities
cites work: Q3905599
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
cites work: Q3317655
cites work: Inexact implicit methods for monotone general variational inequalities
cites work: Modified Projection-Type Methods for Monotone Variational Inequalities
cites work: A class of iterative methods for solving nonlinear projection equations
cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
cites work: Some recent advances in projection-type methods for variational inequalities
cites work: Some new projection methods for variational inequalities
cites work: On the convergence of projection methods: Application to the decomposition of affine variational inequalities
cites work: Q4883218
cites work: The relaxed CQ algorithm solving the split feasibility problem
DOI: 10.1016/J.JMAA.2004.07.048
description: scientific article; zbMATH DE number 2136277