Skip to main content

Table 2 Numerical comparisons between different algorithms for \(p=q=1000\)

From: Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming

rr

spr

sr

Method

Iter.

Time

\(\frac{\|L^{k}-L^{*}\|}{\|L^{*}\|}\)

\(\frac{\|S^{k}-S^{*}\|}{\|S^{*}\|}\)

0.05

0.05

0.9

FJD-ALM

105

93.16

2.6808e−04

6.1154e−05

PPPSM

129

131.08

9.9216e−05

2.3683e−05

MHD-ALM

46

46.82

3.5053e−04

9.5144e−05

0.05

0.05

0.6

FJD-ALM

139

117.67

7.1439e−04

6.8845e−05

PPPSM

147

138.08

2.1260e−04

3.4427e−05

MHD-ALM

57

53.31

5.9883e−04

9.8047e−05

0.1

0.1

0.9

FJD-ALM

119

100.13

9.3082e−04

1.6381e−04

PPPSM

188

179.91

2.3296e−04

4.2820e−05

MHD-ALM

61

57.04

8.9591e−04

1.6198e−04

0.1

0.1

0.8

FJD-ALM

133

114.80

1.2760e−03

1.8083e−04

PPPSM

192

182.46

3.7423e−04

5.2624e−05

MHD-ALM

76

67.08

1.3497e−03

1.6979e−04

0.1

0.15

0.9

FJD-ALM

139

117.89

1.9819e−03

2.3040e−04

PPPSM

206

188.47

4.4773e−04

5.7452e−05

MHD-ALM

84

76.34

1.6396e−03

1.8795e−04