From 60df51a8bf69cb51509b317c4fc4da5cb1213d46 Mon Sep 17 00:00:00 2001 From: Janos Gabler Date: Fri, 1 Nov 2024 11:12:30 +0100 Subject: [PATCH] Add a comment. --- docs/source/how_to/how_to_algorithm_selection.ipynb | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/docs/source/how_to/how_to_algorithm_selection.ipynb b/docs/source/how_to/how_to_algorithm_selection.ipynb index 7321cf566..2f9bbb66e 100644 --- a/docs/source/how_to/how_to_algorithm_selection.ipynb +++ b/docs/source/how_to/how_to_algorithm_selection.ipynb @@ -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. " ] }, {