A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem

DOI10.1016/j.cnsns.2023.107699MaRDI QIDQ6189438

No author found.

Publication date: 8 February 2024

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

zbMATH Keywords

split feasibility problemfixed point problemdemicontractive mappingprimal-dual iterative algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Fixed-point theorems (47H10) Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Cites Work

• Solving the variational inequality problem defined on intersection of finite level sets
• A multiprojection algorithm using Bregman projections in a product space
• A new class of differential nonlinear system involving parabolic variational and history-dependent hemi-variational inequalities arising in contact mechanics
• Self-adaptive subgradient extragradient method with inertial modification for solving monotone variational inequality problems and quasi-nonexpansive fixed point problems
• A relaxed projection method using a new linesearch for the split feasibility problem
• On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
• A minimax approach for inverse variational inequalities
• Convergence of a generalized penalty method for variational-hemivariational inequalities
• A self-adaptive iterative algorithm for the split common fixed point problems
• Viscosity approximation methods for solving fixed-point problems and split common fixed-point problems
• Second order evolutionary problems driven by mixed quasi-variational-hemivariational inequalities
• Solving the split feasibility problem without prior knowledge of matrix norms
• A relaxed projection method for variational inequalities
• 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
• Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators
• Convex analysis and monotone operator theory 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
• Convergence analysis of a new Bregman extragradient method for solving fixed point problems and variational inequality problems in reflexive Banach spaces

This page was built for publication: A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem