Unconstrained Optimization on CUTEst DIXMAANG n=3000
1Objective ValueARC-CP
Evaluation Results
| Method | Links | |||||
|---|---|---|---|---|---|---|
| ARC-CPSubproblem Solver=Cauchy point method2022.09 | 1 | 0.0003 | 0.0007 | 2,000 | 35.16 | |
| ARC-GDSubproblem Solver=Gradient descent method2022.09 | 1 | 0.0001 | 0.0007 | 200 | 33.83 | |
| ARC-Krylov(10)number of Lanczos basis vectors (k)=102022.09 | 1 | 0 | 0.0007 | 500 | 32.18 | |
| ARC-Krylov(30)number of Lanczos basis vectors (k)=302022.09 | 1 | 0 | 0.0007 | 46 | 6.65 | |
| ARC-ASEM(1)number of eigenvalues (m)=12022.09 | 1 | 0 | 0.0007 | 30 | 7.51 | |
| ARC-ASEM(10)number of eigenvalues (m)=102022.09 | 1 | 0 | 0.0007 | 42 | 18.74 |