Modified general splitting method for the split feasibility problem

Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

Title not available (Why is that?)
An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
Inertial Douglas-Rachford splitting for monotone inclusion problems
Solving proximal split feasibility problems without prior knowledge of operator norms
An algorithm for a class of split feasibility problems: application to a model in electricity production
An efficient simultaneous method for the constrained multiple-sets split feasibility problem
``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
Convergence theorems for inertial KM-type algorithms
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
A multiprojection algorithm using Bregman projections in a product space
An inertial Mann algorithm for nonexpansive mappings
Note on the modified relaxation CQ algorithm for the split feasibility problem
On the proximal gradient algorithm with alternated inertia
On variable-step relaxed projection algorithm for variational inequalities
A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
General splitting methods with linearization for the split feasibility problem
Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
Non-convex split Feasibility problems: models, algorithms and theory
Global and linear convergence of alternated inertial methods for split feasibility problems
Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
Inertial accelerated algorithms for solving a split feasibility problem
Polyak's gradient method for split feasibility problem constrained by level sets
A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
Solving the split equality problem without prior knowledge of operator norms
A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
Solving the split feasibility problem without prior knowledge of matrix norms
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
The multiple-sets split feasibility problem and its applications for inverse problems
Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
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
A generic online acceleration scheme for optimization algorithms via relaxation and inertia
An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
Splitting methods for split feasibility problems with application to Dantzig selectors
Linear convergence of CQ algorithms and applications in gene regulatory network inference
A note on the CQ algorithm for the split feasibility problem
Convex analysis and monotone operator theory in Hilbert spaces
Two inertial-type algorithms for solving the split feasibility problem

This page was built for publication: Modified general splitting method for the split feasibility problem

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