Linear approximation method for solving split inverse problems and its applications

DOI10.1007/S10444-022-09959-XOpenAlexW4283122195WikidataQ114227743 ScholiaQ114227743MaRDI QIDQ2154707FDOQ2154707

Jing Zhao, Guash Haile Taddele, Yuan Li, Poom Kumam, Aviv Gibali

Publication date: 20 July 2022

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-022-09959-x

Recommendations

• Several inertial methods for solving split convex feasibilities and related problems
• The multiple-sets split feasibility problem and its applications for inverse problems
• A note on the multiple-set split convex feasibility problem in Hilbert space
• Constructive approximation of solutions to proximal split feasibility problems
• Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems

zbMATH Keywords

strong convergenceequilibrium problemhalf-spacesplit feasibility problemself-adaptive technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Convex analysis and monotone operator theory in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert 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
• Iterative oblique projection onto convex sets and the split feasibility problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Strong convergence of a self-adaptive method for the split feasibility problem
• Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• Strong convergence of a relaxed CQ algorithm for the split feasibility problem
• Iterative methods for fixed point problems in Hilbert spaces
• Title not available (Why is that?)
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• The relaxed CQ algorithm solving the split feasibility problem
• Split Feasibility and Fixed Point Problems
• An iterative method for common solutions of equilibrium problems and hierarchical fixed point problems
• Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces
• Equilibrium programming using proximal-like algorithms
• Convergence of an adaptive penalty scheme for finding constrained equilibria
• Equilibrium models and variational inequalities.
• New approach to solving a system of variational inequalities and hierarchical problems
• Title not available (Why is that?)
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
• An iterative method for solving split monotone variational inclusion and fixed point problems
• Title not available (Why is that?)
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
• Perturbation techniques for nonexpansive mappings with applications
• Algorithmic and analytical approaches to the split feasibility problems and fixed point problems
• Fast Algorithms for Projection on an Ellipsoid
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
• An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
• New inertial relaxed method for solving split feasibilities
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• Inertial accelerated algorithms for solving a split feasibility problem
• Several inertial methods for solving split convex feasibilities and related problems
• A fixed point method for solving a split feasibility problem in Hilbert spaces
• Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
• A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
• The split feasibility problem with multiple output sets in Hilbert spaces
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• The ball-relaxed CQ algorithms for the split feasibility problem
• Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints

Cited In (4)

• A new approximation scheme for solving various split inverse problems
• Some properties of orthogonal linear splines and their applications to inverse problems
• Domain decomposition methods for linear inverse problems with sparsity constraints
• Relax-and-split method for nonconvex inverse problems

This page was built for publication: Linear approximation method for solving split inverse problems and its applications

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