Research Article
A General Self-Adaptive Relaxed-PPA Method for Convex Programming with Linear Constraints
Algorithm 2
General dual-primal relaxed-PPA method.
Step 1. Initialization. Let and pick , set . | Step 2. Predictor. Let | , (†) | and | . (††) | Step 3. If the stepsize and are chosen satisfying | , (‡) | then go to Step 4. Otherwise, increase and go back to Step 2. | Step 4. Corrector and updating | . (∧) | Step 5. Adjustment | . | Set . |
|