A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints

Algorithm 3

Adaptation-I.

If𝑑^𝑘_𝑥²_𝑟≥𝜏₁𝑑^𝑘_𝜆²_𝑠

 𝑟∶=𝑟;𝑠∶=𝑠∗2;

elseif𝜏₂𝑑^𝑘_𝑥²_𝑟≤𝑑^𝑘_𝜆²_𝑠

 𝑟∶=𝑟∗2;𝑠∶=𝑠;

else

 𝑟∶=𝑟∗1.5;𝑠∶=𝑠∗1.5.