A New Algorithm for Global Minimization Based on the Combination of Adaptive Random Search and Simplex Algorithm of Nelder and Mead

Miljenko Huzak, Željko ̌ Bajzer

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We propose a new general-purpose algorithm for locating global minima of differentiable and nondifferentiable multivariable functions. The algorithm is based on combination of the adaptive random search approach and the Nelder-Mead simplex minimization. We show that the new hybrid algorithm satisfies the conditions of the theorem for convergence (in probability) to global minimum. By using test functions we demonstrate that the proposed algorithm is far more efficient than the pure adaptive random search algorithm. Some of the considered test functions are related to membership set estimation method for model parameter determination which was successfully applied to kinetic problems in chemistry and biology.

Original languageEnglish (US)
Pages (from-to)775-791
Number of pages17
JournalCroatica Chemica Acta
Volume69
Issue number3
StatePublished - Nov 1996

Fingerprint

Kinetics

ASJC Scopus subject areas

  • Chemistry(all)

Cite this

A New Algorithm for Global Minimization Based on the Combination of Adaptive Random Search and Simplex Algorithm of Nelder and Mead. / Huzak, Miljenko; Bajzer, Željko ̌.

In: Croatica Chemica Acta, Vol. 69, No. 3, 11.1996, p. 775-791.

Research output: Contribution to journalArticle

@article{ecb3c0cb1e1242b5b6259a1ad59389d2,
title = "A New Algorithm for Global Minimization Based on the Combination of Adaptive Random Search and Simplex Algorithm of Nelder and Mead",
abstract = "We propose a new general-purpose algorithm for locating global minima of differentiable and nondifferentiable multivariable functions. The algorithm is based on combination of the adaptive random search approach and the Nelder-Mead simplex minimization. We show that the new hybrid algorithm satisfies the conditions of the theorem for convergence (in probability) to global minimum. By using test functions we demonstrate that the proposed algorithm is far more efficient than the pure adaptive random search algorithm. Some of the considered test functions are related to membership set estimation method for model parameter determination which was successfully applied to kinetic problems in chemistry and biology.",
author = "Miljenko Huzak and Bajzer, {Željko ̌}",
year = "1996",
month = "11",
language = "English (US)",
volume = "69",
pages = "775--791",
journal = "Croatica Chemica Acta",
issn = "0011-1643",
publisher = "Croatian Chemical Society",
number = "3",

}

TY - JOUR

T1 - A New Algorithm for Global Minimization Based on the Combination of Adaptive Random Search and Simplex Algorithm of Nelder and Mead

AU - Huzak, Miljenko

AU - Bajzer, Željko ̌

PY - 1996/11

Y1 - 1996/11

N2 - We propose a new general-purpose algorithm for locating global minima of differentiable and nondifferentiable multivariable functions. The algorithm is based on combination of the adaptive random search approach and the Nelder-Mead simplex minimization. We show that the new hybrid algorithm satisfies the conditions of the theorem for convergence (in probability) to global minimum. By using test functions we demonstrate that the proposed algorithm is far more efficient than the pure adaptive random search algorithm. Some of the considered test functions are related to membership set estimation method for model parameter determination which was successfully applied to kinetic problems in chemistry and biology.

AB - We propose a new general-purpose algorithm for locating global minima of differentiable and nondifferentiable multivariable functions. The algorithm is based on combination of the adaptive random search approach and the Nelder-Mead simplex minimization. We show that the new hybrid algorithm satisfies the conditions of the theorem for convergence (in probability) to global minimum. By using test functions we demonstrate that the proposed algorithm is far more efficient than the pure adaptive random search algorithm. Some of the considered test functions are related to membership set estimation method for model parameter determination which was successfully applied to kinetic problems in chemistry and biology.

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

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

M3 - Article

VL - 69

SP - 775

EP - 791

JO - Croatica Chemica Acta

JF - Croatica Chemica Acta

SN - 0011-1643

IS - 3

ER -