Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
DOI10.11948/20230259MaRDI QIDQ6616491
Nguyen Thi Thu Thuy, Nguyen Trung Nghia
Publication date: 9 October 2024
Published in: Journal of Applied Analysis and Computation (Search for Journal in Brave)
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)
Cites Work
- Title not available (Why is that?)
- Solving the variational inequality problem defined on intersection of finite level sets
- A multiprojection algorithm using Bregman projections in a product space
- The split feasibility problem with multiple output sets for demicontractive mappings
- A new self-adaptive algorithm for solving the split common fixed point problem with multiple output sets in Hilbert spaces
- The split feasibility problem with multiple output sets in Hilbert spaces
- Inertial accelerated algorithms for solving a split feasibility problem
- Two new self-adaptive algorithms for solving the split common null point problem with multiple output sets in Hilbert spaces
- Regularization methods for solving the split feasibility problem with multiple output sets in Hilbert spaces
- 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 ball-relaxed CQ algorithms for the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Self-Adaptive Step Size Algorithm for Solving Variational Inequalities with the Split Feasibility Problem with Multiple Output Sets Constraints
- Regularization and Variable Selection Via the Elastic Net
- Fast Algorithms for Projection on an Ellipsoid
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
- Two new self-adaptive algorithms for solving the split feasibility problem in Hilbert space
- A new relaxed method for the split feasibility problem in Hilbert spaces
- The split common fixed point problem with multiple output sets for demicontractive mappings
Related Items (1)
This page was built for publication: Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616491)