Skip to content

Commit

Permalink
Add a comment.
Browse files Browse the repository at this point in the history
  • Loading branch information
janosg committed Nov 1, 2024
1 parent 4046a88 commit 60df51a
Showing 1 changed file with 3 additions and 1 deletion.
4 changes: 3 additions & 1 deletion docs/source/how_to/how_to_algorithm_selection.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -270,7 +270,9 @@
"This example shows not only that the choice of optimizer is important but that the commonly \n",
"held belief that gradient free optimizers are generally more robust than gradient based \n",
"ones is dangerous! The Neldermead algorithm did \"converge\" and reports success, but\n",
"did not find the optimum. "
"did not find the optimum. It did not even get stuck in a local optimum because we know \n",
"that the Trid function does not have local optima except the global one. It just got \n",
"stuck somewhere. "
]
},
{
Expand Down

0 comments on commit 60df51a

Please sign in to comment.