On variable-step relaxed projection algorithm for variational inequalities

DOI10.1016/J.JMAA.2004.07.048zbMATH Open1056.49018OpenAlexW1965581979MaRDI QIDQ1763409FDOQ1763409

Authors: Qingzhi Yang 

Publication date: 22 February 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.07.048

Recommendations

• On general variable-step relaxed projection method for strongly quasivariational inequalities
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
• The revisit of a projection algorithm with variable steps for variational inequalities
• A relaxed projection method for split variational inequalities
• Publication:4734695

zbMATH Keywords

projectionvariational inequalityrelaxationsplit feasibility problemweak co-coercivitySFP

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40)

Cites Work

• A multiprojection algorithm using Bregman projections in a product space
• Iterative oblique projection onto convex sets and the split feasibility problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Title not available (Why is that?)
• A relaxed projection method for variational inequalities
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• The relaxed CQ algorithm solving the split feasibility problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A class of iterative methods for solving nonlinear projection equations
• Title not available (Why is that?)
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Modified Projection-Type Methods for Monotone Variational Inequalities
• Inexact implicit methods for monotone general variational inequalities
• Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
• Title not available (Why is that?)
• Some recent advances in projection-type methods for variational inequalities
• Some new projection methods for variational inequalities
• An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
• On the convergence of projection methods: Application to the decomposition of affine variational inequalities
• Inexact Newton methods for the nonlinear complementarity problem
• An Outer Approximation Algorithm for Solving General Convex Programs

Cited In (71)

• An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces
• A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces
• A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings
• The split common fixed point problem with multiple output sets for strictly pseudo-contractive mappings
• On inertial non-Lipschitz stepsize algorithms for split feasibility problems
• Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
• An accelerate algorithm for the split equality common fixed-point problem of directed operators
• Linearized Douglas-Rachford method for variational inequalities with Lipschitz mappings
• Modified general splitting method for the split feasibility problem
• A new relaxed method for the split feasibility problem in Hilbert spaces
• An adaptive block iterative process for a class of multiple sets split variational inequality problems and common fixed point problems in Hilbert spaces
• A new inertial self-adaptive algorithm for split common fixed-point problems
• A new convergence theorem of a projection algorithm with variable steps for variational inequalities
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
• Strong convergence theorem of two-step iterative algorithm for split feasibility problems
• A simple algorithm for computing projection onto intersection of finite level sets
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
• An explicit method for the split feasibility problem with self-adaptive step sizes
• A self-adaptive iterative algorithm for the split common fixed point problems
• A note on Solodov and Tseng's methods for maximal monotone mappings
• Inertial accelerated algorithms for the split common fixed-point problem of directed operators
• A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• A new tensor projection method for tensor variational inequalities
• The extragradient algorithm with inertial effects for solving the variational inequality
• The projection and contraction methods for finding common solutions to variational inequality problems
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
• Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
• Two inertial-type algorithms for solving the split feasibility problem
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• Another look at Wang's new method for solving split common fixed-point problems without priori knowledge of operator norms
• The subgradient double projection method for variational inequalities in a Hilbert space
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• A modified subgradient extragradient method for solving the variational inequality problem
• Adapting step size algorithms for solving split equilibrium problems with applications to signal recovery
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
• Hybrid simultaneous algorithms for the split equality problem with applications
• New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
• An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Inertial extragradient algorithms for strongly pseudomonotone variational inequalities
• On descent-projection method for solving the split feasibility problems
• An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces
• Strong convergence of a self-adaptive method for the split feasibility problem
• A new method for split common fixed-point problem without priori knowledge of operator norms
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
• The common solutions of the split feasibility problems and fixed point problems
• Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
• Tensor variational inequalities: theoretical results, numerical methods and applications to an economic equilibrium model
• On general variable-step relaxed projection method for strongly quasivariational inequalities
• Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
• An algorithm for the split-feasibility problems with application to the split-equality problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• The relaxed inexact projection methods for the split feasibility problem
• Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
• A relaxed projection method for split variational inequalities
• Preconditioning methods for solving a general split feasibility problem
• A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery
• A new extragradient algorithm with adaptive step-size for solving split equilibrium problems
• Local linear convergence of an outer approximation projection method for variational inequalities
• An approximate gradient-type method for nonlinear symmetric equations with convex constraints
• On the convergence of CQ algorithm with variable steps for the split equality problem
• Weak co-coercivity and its applications in several algorithms for solving variational inequalities
• The ball-relaxed CQ algorithms for the split feasibility problem

This page was built for publication: On variable-step relaxed projection algorithm for variational inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763409)