Mathematical Programming

, Volume 10, Issue 1, pp 230–244 | Cite as

Optimized relative step size random searches

  • Günther Schrack
  • Mark Choit


New results concerning the family of random searches as proposed by Rastrigin are presented. In particular, the random search with reversals and two optimized relative step size random searches are investigated. Random searches with reversals are found to be substantially better than their counterparts. A new principle of updating the step size for this family of searches is proposed.


Mathematical Method Random Search Relative Step Relative Step Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.L. Anderson, “Recent advances in finding best operating conditions”,Journal of the American Statistical Association 48 (1953) 789–798.CrossRefGoogle Scholar
  2. [2]
    J.P. Lawrence III and F.P. Emad, “An analytic comparison of random searching and gradient searching for the extremum of a known objective function”,IEEE Transactions on Automatic Control AC-18 (1973) 669–671.Google Scholar
  3. [3]
    J.P. Lawrence III and K. Steiglitz, “Randomized pattern search”,IEEE Transactions on Computers C-21 (1972) 382–385.Google Scholar
  4. [4]
    V.A. Mutseniyeks and L.A. Rastrigin, “Extremal control of continuous multi-parameter systems by the method of random search”,Engineering Cybernetics 1 (1964) 82–90.Google Scholar
  5. [5]
    L.A. Rastrigin, “Extremal control by the method of random scanning”,Automation and Remote Control 21 (1960) 891–896.zbMATHGoogle Scholar
  6. [6]
    L.A. Rastrigin, “The convergence of the random search method in the extremal control of a many-parameter system”,Automation and Remote Control 24 (1963) 1337–1342.Google Scholar
  7. [7]
    G. Schrack and N. Borowski, “An experimental comparison of three random searches”, in: F.A. Lootsma, Ed.,Numerical methods for non-linear optimization (Academic Press, London, 1972) pp. 137–147.Google Scholar
  8. [8]
    M.A. Schumer and K. Steiglitz, “Adaptive step size random search”,IEEE Transactions on Automatic Control AC-13 (1968) 270–276.CrossRefGoogle Scholar
  9. [9]
    R.C. White, Jr., “A survey of random methods for parameter optimization”,Simulation 17 (1971) 197–205.MathSciNetCrossRefGoogle Scholar
  10. [10]
    M.J. Wozny and G.T. Heydt, “Hyperconical random search”,Transactions of the ASME, Journal of Dynamic Systems, Measurements, and Control 94G (1972) 71–78.CrossRefGoogle Scholar

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • Günther Schrack
    • 1
  • Mark Choit
    • 1
  1. 1.Department of Electrical EngineeringThe University of British ColumbiaVancouverCanada

Personalised recommendations