Related Experiment Video
Updated: Feb 13, 2026

Characterize Disease-related Mutants of RAF Family Kinases by Using a Set of Practical and Feasible Methods
Published on: July 17, 2019
Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
1School of Management, Qufu Normal University, Shandong, China.
Abstract:
In this paper, we present an extended alternating proximal penalization algorithm for the modified multiple-sets feasibility problem. For this method, we first show that the sequences generated by the algorithm are summable, which guarantees that the distance between two adjacent iterates converges to zero, and then we establish the global convergence of the algorithm provided that the penalty parameter tends to zero.
More Related Videos
Related Concept Videos
Alternative Sets of Equilibrium Equations
One example of such a situation can be observed in a...
¹H NMR Signal Multiplicity: Splitting Patterns
Alternative RNA Splicing
There are five types of alternative RNA splicing that vary in the ways the pre-mRNA segments are removed or retained in the mature mRNA. The first...
Alternative RNA Splicing
Trial and Error and Algorithm
¹H NMR: Complex Splitting
Splitting diagrams or splitting tree diagrams are routinely used to depict such complex couplings. While drawing splitting diagrams, the splitting with the larger coupling constant is usually applied...

