A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
From MaRDI portal
Publication:2000703
DOI10.1007/S11784-019-0684-0zbMATH Open1415.47010OpenAlexW2937942925WikidataQ113106009 ScholiaQ113106009MaRDI QIDQ2000703FDOQ2000703
Authors: Y. Shehu, Phan Tu Vuong, Prasit Cholamjiak 
Publication date: 28 June 2019
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11784-019-0684-0
Recommendations
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- An inertial iterative algorithm with strong convergence for solving modified split feasibility problem in Banach spaces
- A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
Nonlinear accretive operators, dissipative operators, etc. (47H06) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)
Cites Work
- Title not available (Why is that?)
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem
- Successive linear programming approach for solving the nonlinear split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- Algorithms for the split variational inequality problem
- An iterative row-action method for interval convex programming
- Nonlinear functional analysis. Fixed point theory and its applications
- Title not available (Why is that?)
- Inequalities in Banach spaces with applications
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Regularization methods in Banach spaces.
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
- Proximal point algorithms with Bregman functions in Banach spaces
- Convex functions, monotone operators and differentiability.
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- On variable-step relaxed projection algorithm for variational inequalities
- Convergence of a splitting inertial proximal method for monotone operators
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- 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
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving proximal split feasibility problems without prior knowledge of operator norms
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Split monotone variational inclusions
- Convergence theorems for inertial KM-type algorithms
- An inertial alternating direction method of multipliers
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
- Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping
- Matrix \(p\)-norms are NP-hard to approximate if \(p\neq1,2,\infty\)
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces
- Some methods of speeding up the convergence of iteration methods
- An inertial forward-backward algorithm for monotone inclusions
- Title not available (Why is that?)
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Inertial proximal ADMM for linearly constrained separable convex optimization
- A conjugate gradient like method for \(p\)-norm minimization in functional spaces
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Iterative methods for split feasibility problems in certain Banach spaces
- A new split inverse problem and an application to least intensity feasible solutions
- Iterative methods for the split feasibility problem in Banach spaces
- Title not available (Why is that?)
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- Inertial accelerated algorithms for solving a split feasibility problem
- Title not available (Why is that?)
Cited In (30)
- Alternated inertial relaxed Tseng method for solving fixed point and quasi-monotone variational inequality problems
- Inertial accelerated algorithms for the split common fixed-point problem of directed operators
- A strongly convergent algorithm for solving split equality problems beyond monotonicity
- Inertial self‐adaptive algorithm for solving split feasible problems with applications to image restoration
- New inertial relaxed method for solving split feasibilities
- Linear approximation method for solving split inverse problems and its applications
- Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
- Dynamical technique for split common fixed point problem in Banach spaces
- Inertial-type algorithm for solving split common fixed point problems in Banach spaces
- A modified subgradient extragradient algorithm-type for solving quasimonotone variational inequality problems with applications
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
- A new algorithm for approximating solutions of the common variational inclusion
- An accelerate algorithm for the split equality common fixed-point problem of directed operators
- Modified general splitting method for the split feasibility problem
- Modified viscosity implicit rules for proximal split feasibility and fixed point problems
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- Self-adaptive forward-backward contraction-type methods for generalized split feasibility problems
- On split generalized equilibrium problem with multiple output sets and common fixed points problem
- Hybrid iterative scheme for variational inequality problem involving pseudo-monotone operator with application in signal recovery
- Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery
- The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
- Global and linear convergence of alternated inertial methods for split feasibility problems
- Double inertial subgradient extragradient algorithm for solving equilibrium problems and common fixed point problems with application to image restoration
- Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
- Strong convergence theorem for some nonexpansive-type mappings in certain Banach spaces
- Novel inertial methods for fixed point problems in reflexive Banach spaces with applications
- Inertial Halpern-type method for solving split feasibility and fixed point problems via dynamical stepsize in real Banach spaces
- Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces
- An inertial Halpern-type algorithm involving monotone operators on real Banach spaces with application to image recovery problems
This page was built for publication: A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000703)
