An alternated inertial general splitting method with linearization for the split feasibility problem

DOI10.1080/02331934.2022.2069567OpenAlexW4229063276MaRDI QIDQ6048271

Xiaolong Qin, Lulu Liu, Jen-Chih Yao, Qiao-Li Dong

Publication date: 10 October 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2022.2069567

zbMATH Keywords

split feasibility problemalternated inertial CQ algorithmalternated inertial general splitting method with linearisationgeneral splitting methods with linearisation

Mathematics Subject Classification ID

Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators ⋮ A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration ⋮ New Bregman projection algorithms for solving the split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An algorithm for a class of split feasibility problems: application to a model in electricity production
• ``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
• An inertial type iterative method with Armijo linesearch for nonmonotone equilibrium problems
• Iterative algorithms for solving the split feasibility problem in Hilbert spaces
• On the proximal gradient algorithm with alternated inertia
• General splitting methods with linearization for the split feasibility problem
• An inertial subgradient extragradient algorithm extended to pseudomonotone equilibrium problems
• New inertial relaxed method for solving split feasibilities
• Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
• 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
• Inertial accelerated algorithms for solving a split feasibility problem
• Polyak's gradient method for split feasibility problem constrained by level sets
• A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• Solving the split feasibility problem without prior knowledge of matrix norms
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• A First-Order Primal-Dual Algorithm with Linesearch
• Some methods of speeding up the convergence of iteration methods
• Strong convergence of inertial forward–backward methods for solving monotone inclusions
• Convex analysis and monotone operator theory in Hilbert spaces