Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
From MaRDI portal
Publication:6576143
DOI10.24193/fpt-ro.2024.1.16MaRDI QIDQ6576143
Yekini Shehu, Ferdinard Udochukwu Ogbuisi, Jen-Chih Yao
Publication date: 22 July 2024
Published in: Fixed Point Theory (Search for Journal in Brave)
fixed pointHilbert spacebounded linear operatorsplit feasibility problemsalternated inertial methodrelaxed CQ-algorithms
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37) Fixed-point theorems (47H10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- An inertial forward-backward algorithm for monotone inclusions
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Regularized and inertial algorithms for common fixed points of nonlinear operators
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- A multiprojection algorithm using Bregman projections in a product space
- Asymptotic control and stabilization of nonlinear oscillators with non-isolated equilibria
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- On the proximal gradient algorithm with alternated inertia
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- An inertial alternating direction method of multipliers
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
- Iterative oblique projection onto convex sets and the split feasibility problem
- A First-Order Primal-Dual Algorithm with Linesearch
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
- FIXED-POINT THEOREMS FOR NONCOMPACT MAPPINGS IN HILBERT SPACE
- Some methods of speeding up the convergence of iteration methods
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems