An Efficient Pattern Search Method


Pattern search algorithms is one of most frequently used methods which were designed to solve the derivative-free optimization problems. Such methods get growing need with the development of science, engineering, economy and so on. Inspired by the idea of Hooke and Jeeves, we introduced an integer m in the algorithm which controls the number of steps of iteration update. We mean along the descent direction to allow the algorithm to go ahead m steps at most to explore whether we can get better solution further. The experiment proved the strategy’s efficiency.

Share and Cite:

Zhang, X. , Zhou, Q. and Wang, Y. (2013) An Efficient Pattern Search Method. Journal of Applied Mathematics and Physics, 1, 68-72. doi: 10.4236/jamp.2013.14013.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] A. Ismael, F. Vaz and L. N. Vicente, “A Particle Swarm Pattern Search Method for Bound Constrained Global Optimization,” J. Glob. Optim., Vol. 39, No. 2, 2007, pp. 197-219.
[2] S. Sankaran, C. Audet and A. L. Marsden, “A Method for Stochastic Constrained Optimization Using Derivative-Free Surrogate Pattern Search and Collocation,” J. Comput. Phys., Vol. 229, No. 12, 2010, pp. 4664-4682.
[3] J. Yuan, Z. Liu and Y. Wu, “Discriminative Video Pattern Search for Efficient Action Detection,” IEEE Trans. on PAMI., Vol. 33, No. 9, 2011, pp. 1728-1743.
[4] R. M. Lewis, V. Torczon and M. W. Trosset, “Direct Search Methods: Then and Now,” J. Comp. Appl. Math., Vol. 124, No. 1-2, 2000, pp. 191-207.
[5] V. Torczon, “On the Convergence of Pattern Search Al- gorithms,” SIAM J. Optim, Vol. 7, 1997, pp. 1-25.
[6] R. M. Lewis and V. Torczon, “Rank Ordering and Positive Bases in Pattern Search Algorithms,” Technical re port TR96-71, ICASE, 2000.
[7] R. Hooke and T. A. Jeeves, “’Direct Search’ Solution of Numerical and Statistical Problems,” J. ACM., Vol. 8, No. 2, 1961, pp. 212-229.
[8] C. Davis, “Theory of Positive Linear Dependence,” Amer. J. Math., Vol. 76, 1954, pp. 733-746.
[9] V. Torczon, “Multi-Directional Search: A Direct Search Algorithm for Parallel Machines,” PH.D Thesis, Department of Mathematical sciences, Rice University, Houston, TX, 1989.
[10] J. J. Mor, B. S. Garbow and K. E. Hillstrom, “Testing Unconstrained Optimization Software,” ACM Transactions on Mathematical Software, Vol. 7, 1981, pp. 17-41.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.