unknown

These archived files have no code field, and the entry name does not match a registry id. They stay on this page.

No registry pin.

Best cost

Best cost for Lennard-Jones 38 clustersLennard-Jones 38 clusters10¹10²10³10⁴10⁵cost (force calls, log scale)unknown: 79unknown79rgmin: 81.881rgmin81.881TSASE: 166TSASE166OPTIM: 176OPTIM176pele: 179pele179eOn: 180.137eOn180.137Eon svn: 181Eon svn181DL-FIND: 231.908DL-FIND231.908GMIN: 301.399GMIN301.399ASE: 374.645ASE374.645vc-SQNM: 598.05vc-SQNM598.05Sella: 710.089Sella710.089LAMMPS: 1123.81LAMMPS1123.81pysisyphus: 15124.7pysisyphus15124.7
A shorter bar is a lower cost on a log scale shared by the codes of this problem.

Results

Ranked rows for this code, one version and one method on each row. PAR-2 counts a finished run as the calls it used and a failed run as twice the cap. An archived row shows the average it published, and its PAR-2 applies that rule to the failures the entry records. Scoring rules.

Every ranked row for this code. Select a column heading to sort.
SuiteProblemRowFamilyFamily rankUnitPAR-2PublishedMedian callsMean callsHessiansFD callsFailuresRuns
Minimization Lennard-Jones 38 clusters Newtons Method maxstep=0.25 Minimizers 1 force calls 79 79 79 0 0 0 failed 1000