A hybrid global optimization algorithm involving simplex and inductive search

Chetan Offord, Željko Bajzer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations


We combine the recently proposed inductive search and the Nelder-Mead simplex method to obtain a hybrid global optimizer, which is not based on random searches. The global search is performed by line minimizations (Brent's method) and plane minimizations (simplex method), while the local multidimensional search employs the standard and a modified simplex method. Results for the test bed of the Second International Competition of Evolutionary Optimization and for another larger test bed show remarkable success. The algorithm was also effcient in minimizing functions related to energy of protein folding.

Original languageEnglish (US)
Title of host publicationComputational Science – ICCS 2001 - International Conference, Proceedings
EditorsVassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, Rene S. Renner, C.J. Kenneth Tan
PublisherSpringer Verlag
Number of pages9
ISBN (Print)3540422331, 9783540422334
StatePublished - 2001
EventInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
Duration: May 28 2001May 30 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherInternational Conference on Computational Science, ICCS 2001
Country/TerritoryUnited States
CitySan Francisco

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'A hybrid global optimization algorithm involving simplex and inductive search'. Together they form a unique fingerprint.

Cite this