A relaxed projection method for split variational inequalities
DOI10.1007/s10957-014-0598-3zbMath1323.65079OpenAlexW2166043714MaRDI QIDQ493247
Chen Ling, Hong-Kun Xu, Hongjin He
Publication date: 3 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0598-3
global convergencesignal recoveryimage processingmonotone operatorprojection methodnumerical experimentseparable structuresplit feasibility problemsplit variational inequality
Convex programming (90C25) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative approximation of a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem
- Split nonconvex variational inequality problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A von Neumann alternating method for finding common solutions to variational inequalities
- Common solutions to variational inequalities
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
- Quadratically constrained least squares and quadratic problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- A multiprojection algorithm using Bregman projections in a product space
- A new inexact alternating directions method for monotone variational inequalities
- A viscosity method with no spectral radius requirements for the split common fixed point problem
- An iterative method for finding common solutions of equilibrium and fixed point problems
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Proximal alternating directions method for structured variational inequalities
- A hybrid splitting method for variational inequality problems with separable structure
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- Iterative Methods for Solving Systems of Variational Inequalities in Reflexive Banach Spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Perturbation resilience and superiorization of iterative algorithms
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- 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
- The Split Common Null Point Problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iterative projection onto convex sets using multiple Bregman distances
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The relaxed CQ algorithm solving the split feasibility problem