A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
From MaRDI portal
Publication:6145664
DOI10.1007/s10114-023-2311-7OpenAlexW4389444964MaRDI QIDQ6145664
Nguyen The Vinh, Le Anh Dung, Pham Thi Hoai, Yeol Je Cho
Publication date: 9 January 2024
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-023-2311-7
Computational methods for sparse matrices (65F50) Numerical optimization and variational techniques (65K10) Fixed-point theorems (47H10) Set-valued operators (47H04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- An extragradient method for solving split feasibility and fixed point problems
- Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- A multiprojection algorithm using Bregman projections in a product space
- General splitting methods with linearization for the split feasibility problem
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Inertial accelerated algorithms for solving a split feasibility problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- 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
- The multiple-sets split feasibility problem and its applications for inverse problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Split Feasibility and Fixed Point Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A note on the CQ algorithm for the split feasibility problem
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
