scientific article; zbMATH DE number 7248491

zbMath1463.65139MaRDI QIDQ5121081

Suparat Kesornprom, Prasit Cholamjiak

Publication date: 17 September 2020

Full work available at URL: http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/3375

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hilbert spaceprojectionsplit feasibility problemCQ algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the variational inequality problem defined on intersection of finite level sets
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• Strong convergence of a self-adaptive method for the split feasibility problem in Banach spaces
• A multiprojection algorithm using Bregman projections in a product space
• A modified iterative algorithm for split feasibility problems of right Bregman strongly quasi-nonexpansive mappings in Banach spaces with applications
• Modified hybrid block iterative algorithm for convex feasibility problems and generalized equilibrium problems for uniformly quasi-\(\varphi \)-asymptotically nonexpansive mappings
• A new CQ algorithm for solving split feasibility problems in Hilbert spaces
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• 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
• The relaxed CQ algorithm solving the split feasibility problem
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Modified Hybrid Steepest Method for the Split Feasibility Problem in Image Recovery of Inverse Problems
• Nonlinear iterative methods for solving the split common null point problem in Banach spaces
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: