An inertial extrapolation method for multiple-set split feasibility problem

DOI10.1186/S13660-020-02508-4zbMATH Open1487.47113OpenAlexW3101877570MaRDI QIDQ2069587FDOQ2069587

Authors: Guash Haile Taddele, Poom Kumam, Anteneh Getachew Gebrie 

Publication date: 20 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-020-02508-4

Recommendations

• An extrapolated iterative algorithm for multiple-set split feasibility problem
• An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
• An inertial triple-projection algorithm for solving the split feasibility problem

zbMATH Keywords

strong convergencesubdifferentialsublevel setmultiple-set split feasibility probleminertial extrapolationself-adaptive technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• A multiprojection algorithm using Bregman projections in a product space
• 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
• A note on the multiple-set split convex feasibility problem in Hilbert space
• Signal Recovery by Proximal Forward-Backward Splitting
• Algorithms for the split variational inequality problem
• Implicit and explicit algorithms for solving the split feasibility problem
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• Title not available (Why is that?)
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Viscosity approximation methods for fixed-points problems
• The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• A relaxed projection method for variational inequalities
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• 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
• Generalized KM theorems and their applications
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem
• Split monotone variational inclusions
• Convergence theorems for inertial KM-type algorithms
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Robust solutions of split feasibility problem with uncertain linear operator
• Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
• Several acceleration schemes for solving the multiple-sets split feasibility problem
• Matrix \(p\)-norms are NP-hard to approximate if \(p\neq1,2,\infty\)
• A cyclic iterative method for solving multiple sets split feasibility problems in Banach spaces
• An inertial forward-backward algorithm for monotone inclusions
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• Several iterative algorithms for solving the split common fixed point problem of directed operators with applications
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• Two projection algorithms for solving the split common fixed point problem
• A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
• Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
• Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
• Piecewise smooth Lyapunov function for a nonlinear dynamical system
• Parallel proximal method of solving split system of fixed point set constraint minimization problems
• Strong convergence result of split feasibility problems in Banach spaces
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Parallel iterative methods for solving the split common fixed point problem in Hilbert spaces
• Gradient methods with selection technique for the multiple-sets split feasibility problem
• Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces

Cited In (10)

• On split monotone variational inclusion problem with multiple output sets with fixed point constraints
• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem
• An extrapolated iterative algorithm for multiple-set split feasibility problem
• An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces
• An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
• A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
• An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
• Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
• Self-adaptive algorithms for solving split feasibility problem with multiple output sets
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem

This page was built for publication: An inertial extrapolation method for multiple-set split feasibility problem

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