On variable-step relaxed projection algorithm for variational inequalities
From MaRDI portal
Publication:1763409
DOI10.1016/j.jmaa.2004.07.048zbMath1056.49018OpenAlexW1965581979MaRDI QIDQ1763409
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
Related Items
Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size ⋮ A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem ⋮ The projection and contraction methods for finding common solutions to variational inequality problems ⋮ A new convergence theorem of a projection algorithm with variable steps for variational inequalities ⋮ Hybrid simultaneous algorithms for the split equality problem with applications ⋮ A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces ⋮ The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem ⋮ Preconditioning methods for solving a general split feasibility problem ⋮ Adaptively relaxed algorithms for solving the split feasibility problem with a new step size ⋮ A new tensor projection method for tensor variational inequalities ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ On descent-projection method for solving the split feasibility problems ⋮ Strong convergence of a relaxed CQ algorithm for the split feasibility problem ⋮ An algorithm for the split-feasibility problems with application to the split-equality problem ⋮ A new method for split common fixed-point problem without priori knowledge of operator norms ⋮ Adapting step size algorithms for solving split equilibrium problems with applications to signal recovery ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ Two inertial-type algorithms for solving the split feasibility problem ⋮ Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints ⋮ Strong convergence theorems for the split variational inclusion problem in Hilbert spaces ⋮ A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery ⋮ On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem ⋮ Linearized Douglas-Rachford method for variational inequalities with Lipschitz mappings ⋮ An accelerate algorithm for the split equality common fixed-point problem of directed operators ⋮ An explicit method for the split feasibility problem with self-adaptive step sizes ⋮ An adaptive block iterative process for a class of multiple sets split variational inequality problems and common fixed point problems in Hilbert spaces ⋮ The common solutions of the split feasibility problems and fixed point problems ⋮ An approximate gradient-type method for nonlinear symmetric equations with convex constraints ⋮ A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ The split common fixed point problem with multiple output sets for strictly pseudo-contractive mappings ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Local linear convergence of an outer approximation projection method for variational inequalities ⋮ Weak co-coercivity and its applications in several algorithms for solving variational inequalities ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ A modified subgradient extragradient method for solving the variational inequality problem ⋮ On the convergence of CQ algorithm with variable steps for the split equality problem ⋮ The subgradient double projection method for variational inequalities in a Hilbert space ⋮ Strong convergence of a self-adaptive method for the 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 note on Solodov and Tseng's methods for maximal monotone mappings ⋮ ``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 ⋮ Inertial extragradient algorithms for strongly pseudomonotone variational inequalities ⋮ Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ Tensor variational inequalities: theoretical results, numerical methods and applications to an economic equilibrium model ⋮ A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms ⋮ A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings ⋮ Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces ⋮ The extragradient algorithm with inertial effects for solving the variational inequality ⋮ A new extragradient algorithm with adaptive step-size for solving split equilibrium problems ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Unnamed Item ⋮ On general variable-step relaxed projection method for strongly quasivariational inequalities ⋮ A self-adaptive iterative algorithm for the split common fixed point problems ⋮ Strong convergence theorem of two-step iterative algorithm for split feasibility problems ⋮ A simple algorithm for computing projection onto intersection of finite level sets ⋮ New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- A multiprojection algorithm using Bregman projections in a product space
- A class of iterative methods for solving nonlinear projection equations
- Some new projection methods for variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- Some recent advances in projection-type methods for variational inequalities
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- A relaxed projection method for variational inequalities
- An Outer Approximation Algorithm for Solving General Convex Programs
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Inexact Newton methods for the nonlinear complementarity problem
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The relaxed CQ algorithm solving the split feasibility problem
This page was built for publication: On variable-step relaxed projection algorithm for variational inequalities
