Alternated inertial algorithms for split feasibility problems
DOI10.1007/s11075-023-01589-8OpenAlexW4381489648MaRDI QIDQ6140898
No author found.
Publication date: 22 January 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-023-01589-8
signal processingimage restorationsplit feasibility problemCQ methodprojection and contraction methodalternated inertial method
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Variational methods involving nonlinear operators (47J30) Iterative procedures involving nonlinear operators (47J25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Strong convergence result for solving monotone variational inequalities in Hilbert space
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On the proximal gradient algorithm with alternated inertia
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- New inertial relaxed method for solving split feasibilities
- Inertial extragradient algorithms with non-monotone stepsizes for pseudomonotone variational inequalities and applications
- Two optimization approaches for solving split variational inclusion problems with applications
- Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities
- Non-convex split Feasibility problems: models, algorithms and theory
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- Global and linear convergence of alternated inertial methods for split feasibility problems
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- First-Order Methods in Optimization
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A new approach to solving split equality problems in Hilbert spaces
- Some methods of speeding up the convergence of iteration methods
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A note on the CQ algorithm for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- Benchmarking optimization software with performance profiles.
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
