Stepping away from maximizers of concave quadratics in random line search

Sahin I., Yilmazer N., Celebi T., Ozcelik S., Ajofoyinbo A.

EVOLUTIONARY INTELLIGENCE, vol.13, no.4, pp.663-676, 2020 (ESCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 13 Issue: 4
  • Publication Date: 2020
  • Doi Number: 10.1007/s12065-020-00380-1
  • Journal Indexes: Emerging Sources Citation Index (ESCI), Scopus, Compendex, INSPEC, zbMATH
  • Page Numbers: pp.663-676
  • Yıldız Technical University Affiliated: Yes


Random Lines (RL) search relies on finding a minimizer of a given cost function along randomly selected lines in the function domain. Once three points along each line are identified, a quadratic function passing through these points is determined and the minimum of the function is used whenever the function is convex. This paper proposes a two-step approach for handling concave cases: (1) starting from a point with the smallest function value and then (2) stepping in the direction away from the maximizer of the quadratic function. Promising numerical results comparing the improved RL method with other similar evolutionary methods are presented.