Related Experiment Video
Updated: Feb 27, 2026

Split Point Analysis and Uncertainty Quantification of Thermal-Optical Organic/Elemental Carbon Measurements
Published on: September 7, 2019
New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
Peiyuan Wang1,2, Jianjun Zhou1, Risheng Wang1
1Postdoctoral workstation, China Marine Development and Reserch Center (CMDRC), P.O. Box 1301, Beijing, 102249 China.
Abstract:
Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first to introduce two new simpler variable stepsizes of the CQ algorithm. Then two new generalized variable stepsizes which can cover the former ones are also proposed in real Hilbert spaces. And then, two more general KM (Krasnosel'skii-Mann)-CQ algorithms are also presented. Several weak and strong convergence properties are established. Moreover, some numerical experiments have been taken to illustrate the performance of the proposed stepsizes and algorithms.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an...
Statically Indeterminate Problem Solving
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Cochran's Q Test

