Hooke&Jeeves

代码说明：

  Pattern search (also known as direct search, derivative-free search, or black-box search) is a family of numerical optimization methods that does not require a gradient. As a result, it can be used on functions that are not continuous or differentiable. One such pattern search method is "convergence" (see below), which is based on the theory of positive bases. Optimization attempts to find the best match (the solution that has the lowest error value) in a multidimensional analysis space of possibilities.

文件列表：

Hooke&Jeeves\Chapter17.pdf, 313179 , 2018-06-25
Hooke&Jeeves\f1.m, 51 , 2018-06-25
Hooke&Jeeves\f2.m, 61 , 2018-06-25
Hooke&Jeeves\Hooke_Jeeves.m, 569 , 2018-06-25
Hooke&Jeeves\main.m, 321 , 2018-06-25
Hooke&Jeeves, 0 , 2018-06-25