Randomized Pattern Search
Joseph Lawrence, Kenneth Steiglitz · IEEE Transactions on Computers · 1972
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard constraints.