Unconstrained Optimization on CUTEst BRYBAND n=2000
125,000Final Objective ValueARC-GD
Evaluation Results
| Method | Links | |||||
|---|---|---|---|---|---|---|
| ARC-GDSubproblem Solver=Gradient descent method2022.09 | 125,000 | 4,930 | 440 | 100 | 11.05 | |
| ARC-CPSubproblem Solver=Cauchy point method2022.09 | 749,000,000,000,000 | 0.0011 | 5.4 | 1,000 | 8.27 | |
| ARC-Krylov(10)number of Lanczos basis vectors (k)=102022.09 | 749,000,000,000,000 | 0 | 5.4 | 100 | 9.85 | |
| ARC-Krylov(30)number of Lanczos basis vectors (k)=302022.09 | 749,000,000,000,000 | 0 | 5.4 | 14 | 2.37 | |
| ARC-ASEM(1)number of eigenvalues (m)=12022.09 | 749,000,000,000,000 | 0 | 5.4 | 14 | 2.24 | |
| ARC-ASEM(10)number of eigenvalues (m)=102022.09 | 749,000,000,000,000 | 0 | 5.4 | 14 | 3.83 |