Unconstrained Optimization on CUTEst TOINTGSS n=1000
360,000,000,000,000Objective ValueARC-CP
Evaluation Results
| Method | Links | |||||
|---|---|---|---|---|---|---|
| ARC-CPSubproblem Solver=Cauchy point method2022.09 | 360,000,000,000,000 | 0 | 0 | 1,000 | 6.08 | |
| ARC-GDSubproblem Solver=Gradient descent method2022.09 | 360,000,000,000,000 | 0 | 0 | 1,000 | 6.98 | |
| ARC-Krylov(1)number of Lanczos basis vectors (k)=12022.09 | 360,000,000,000,000 | 0 | 0 | 300 | 6.75 | |
| ARC-Krylov(10)number of Lanczos basis vectors (k)=102022.09 | 360,000,000,000,000 | 0 | 0 | 19 | 1.87 | |
| ARC-ASEM(1)number of eigenvalues (m)=12022.09 | 360,000,000,000,000 | 0 | -0 | 19 | 2.17 | |
| ARC-ASEM(10)number of eigenvalues (m)=102022.09 | 360,000,000,000,000 | 0 | -0 | 19 | 2.74 |