Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
From MaRDI portal
Publication:2035511
DOI10.1007/s11075-020-00999-2zbMath1471.65044OpenAlexW3086107933MaRDI QIDQ2035511
Yeol Je Cho, Xiao-Huan Li, Daya Ram Sahu, M. R. Kashyap, Qiao-Li Dong
Publication date: 24 June 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00999-2
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Numerical analysis in abstract spaces (65J99)
Related Items
Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems, Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications, An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces, Two optimization approaches for solving split variational inclusion problems with applications, An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem, Linear approximation method for solving split inverse problems and its applications, Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators, Two inertial-type algorithms for solving the split feasibility problem, A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery, On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces, An inertial self-adaptive iterative algorithm for finding the common solutions to split feasibility and fixed point problems in specific Banach spaces, Alternated inertial algorithms for split feasibility problems, Strong convergence of forward-reflected-backward splitting methods for solving monotone inclusions with applications to image restoration and optimal control, Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery, An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net, The iterative method for solving the proximal split feasibility problem with an application to LASSO problem, Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets, An inertial triple-projection algorithm for solving the split feasibility problem, An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications
Uses Software
Cites Work
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- A multiprojection algorithm using Bregman projections in a product space
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- On solving proximal split feasibility problems and applications
- Inertial projection and contraction algorithms for variational inequalities
- General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
- The split feasibility problem and its solution algorithm
- On variable-step relaxed projection algorithm for variational inequalities
- New inertial relaxed method for solving split feasibilities
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- Some results for split equality equilibrium problems in Banach spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- 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
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- Monotone Operators and the Proximal Point Algorithm
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Split Feasibility and Fixed Point Problems
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Unnamed Item
- Unnamed Item
- Unnamed Item
