A hybrid global optimization algorithm involving simplex and inductive search

Chetan Offord, Željko Bajzer

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

19 Citations (Scopus)

Abstract

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages680-688
Number of pages9
Volume2074
ISBN (Print)3540422331, 9783540422334
DOIs
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)
Volume2074
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Computational Science, ICCS 2001
CountryUnited States
CitySan Francisco
Period5/28/015/30/01

Fingerprint

Hybrid Optimization
Simplex Method
Global optimization
Global Optimization
Optimization Algorithm
Testbed
Protein folding
Random Search
Protein Folding
Evolutionary Optimization
Global Search
Line
Energy

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Offord, C., & Bajzer, Ž. (2001). A hybrid global optimization algorithm involving simplex and inductive search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2074, pp. 680-688). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074). Springer Verlag. https://doi.org/10.1007/3-540-45718-6_73

A hybrid global optimization algorithm involving simplex and inductive search. / Offord, Chetan; Bajzer, Željko.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074 Springer Verlag, 2001. p. 680-688 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074).

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

Offord, C & Bajzer, Ž 2001, A hybrid global optimization algorithm involving simplex and inductive search. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2074, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2074, Springer Verlag, pp. 680-688, International Conference on Computational Science, ICCS 2001, San Francisco, United States, 5/28/01. https://doi.org/10.1007/3-540-45718-6_73
Offord C, Bajzer Ž. A hybrid global optimization algorithm involving simplex and inductive search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074. Springer Verlag. 2001. p. 680-688. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45718-6_73
Offord, Chetan ; Bajzer, Željko. / A hybrid global optimization algorithm involving simplex and inductive search. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2074 Springer Verlag, 2001. pp. 680-688 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2295919e5aac4137bd7fdc5baea1bf25,
title = "A hybrid global optimization algorithm involving simplex and inductive search",
abstract = "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.",
author = "Chetan Offord and Željko Bajzer",
year = "2001",
doi = "10.1007/3-540-45718-6_73",
language = "English (US)",
isbn = "3540422331",
volume = "2074",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "680--688",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A hybrid global optimization algorithm involving simplex and inductive search

AU - Offord, Chetan

AU - Bajzer, Željko

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=23044525847&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23044525847&partnerID=8YFLogxK

U2 - 10.1007/3-540-45718-6_73

DO - 10.1007/3-540-45718-6_73

M3 - Conference contribution

AN - SCOPUS:23044525847

SN - 3540422331

SN - 9783540422334

VL - 2074

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 680

EP - 688

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -