Research Article

Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization

Table 2

Performance of SDPRP.

Problem Dim Iter Nf Time Fv Pgnorm1

SINEALI 1000 19 64 0.030
BDEXP 1000 10001 10003 6.030
EXPLIN 120 76 260 0.010
EXPLIN2 120 59 183 0.000
EXPQUAD 120 4007 20001 0.230
MCCORMCK 5000 32 72 0.130
PROBPENL 500 18 173 0.010

QRTQUAD 120 949 4240 0.030
S368 100 54 136 0.240

HADAMALS 1024 113 479 0.390

SCOND1LS 5002 5061 20001 81.330
CHEBYQAD 50 735 4514 6.440
HS110 200 1 2 0.000
LINVERSE 1999 1527 1565 2.220
NONSCOMP 5000 67 128 0.110
QR3DLS 610 2760 20000 5.530

DECONVB 61 3353 11830 0.260

QUDLIN 5000 1 2 0.00
BIGGSB1 5000 10001 11535 10.93
BQPGABIM 50 45 213 0.00
BQPGASIM 50 57 223 0.00
BQPGAUSS 2003 3945 20001 6.78
CHENHARK 5000 6335 20001 9.56
CVXBQP1 10000 14 15 0.05
HARKERP2 100 10 47 0.00
JNLBRNG1 10000 4001 7427 38.40
JNLBRNG2 10000 1911 6880 23.35
JNLBRNGA 10000 2182 5955 20.17
JNLBRNGB 10000 4981 20001 54.23
NCVXBQP1 10000 1 2 0.01
NCVXBQP2 10000 3180 20000 16.18
NCVXBQP3 10000 3184 20000 17.11
NOBNDTOR 5476 893 1462 3.54
OBSTCLAE 10000 5261 5794 40.60
OBSTCLAL 10000 813 1121 6.29
OBSTCLBL 10000 3509 3872 26.90
OBSTCLBM 10000 3362 3730 25.97
OBSTCLBU 10000 2126 2454 16.71
PENTDI 1000 11 22 0.00

TORSION1 10000 1550 2401 12.51
TORSION2 10000 3227 4745 26.11
TORSION3 10000 394 712 3.23
TORSION4 10000 2183 2957 17.40
TORSION5 10000 114 228 1.26
TORSION6 10000 1639 1847 12.37
TORSIONA 10000 1410 2273 13.26
TORSIONB 10000 2662 4351 25.30
TORSIONC 10000 433 747 4.41
TORSIOND 10000 2269 3019 20.06
TORSIONE 10000 97 194 0.95
TORSIONF 10000 1589 1775 13.42

ODNAMUR 11130 10001 16448 44.78

GRIDGENA 6218 620 20000 16.58

NOBNDTOR 5476 893 1462 3.69