An efficient simultaneous method for the constrained multiple-sets split feasibility problem
From MaRDI portal
Publication:694525
DOI10.1007/s10589-011-9429-8zbMath1282.90131MaRDI QIDQ694525
Wenxing Zhang, Deren Han, Xiao-Ming Yuan
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9429-8
90C25: Convex programming
Related Items
A new alternating projection-based prediction–correction method for structured variational inequalities, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, An improved method for solving multiple-sets split feasibility problem, Modified alternating direction methods for the modified multiple-sets split feasibility problems, A relaxed projection method for split variational inequalities, A new alternating direction method for linearly constrained nonconvex optimization problems, Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, A new criterion for an inexact parallel splitting augmented Lagrangian method, A modified alternating projection based prediction-correction method for structured variational inequalities, Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Inexact operator splitting methods with selfadaptive strategy for variational inequality problems
- New parallel descent-like method for solving a class of variational inequalities
- An operator splitting method for variational inequalities with partially unknown mappings
- Application of the alternating direction method of multipliers to separable convex programming problems
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A variable-penalty alternating directions method for convex optimization
- A multiprojection algorithm using Bregman projections in a product space
- A new inexact alternating directions method for monotone variational inequalities
- A new halfspace-relaxation projection method for the split feasibility problem
- A Parallel Splitting Method for Coupled Monotone Inclusions
- 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
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- A descent method for structured monotone variational inequalities
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
