finish random restart hill climbing page

Author: SimonBlanke

optimization_tutorial/optimizers/random_restart_hill_climbing/random_restart_hill_climbing_app.py

@@ -23,7 +23,8 @@
 
 explanation_ = """
 Random restart hill climbing works by starting a hill climbing search and jumping to a random 
-new position after `n_iter_restart` iterations.
+new position after `n_iter_restart` iterations. 
+Those restarts should prevent the algorithm getting stuck in local optima.
 """
 
 para_d = dict()
@@ -39,8 +40,7 @@
 
 
 good_ = """ 
-- Good for convex and nonconvex optimization problems
-- 
+- Expect good results for convex and nonconvex optimization problems.
 """
 bad_ = """ 
 - Worse than regular hill climbing algorithm for convex optimization
@@ -53,7 +53,7 @@
 
 implementation_ = """
 The random restart hill climbing inherits its behaviour from the regular hill climbing and 
-expands it by jumping to a random position. 
+expands it by jumping to a random position during the iteration step. 
 """
 
 overview_app_args_d = {