A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints
Figure 1
Comparing SRPPAs applied to BP problem with (a) and (b). The horizontal axis gives the CPU time; the vertical axis gives the error between the solution and the original.
