The parallel downhill simplex algorithm for unconstrained optimisation

DOI<121::AID-CPE291>3.0.CO;2-R 10.1002/(SICI)1096-9128(199802)10:2<121::AID-CPE291>3.0.CO;2-RzbMath0907.65055OpenAlexW1969626436MaRDI QIDQ4208609

Elizabeth C. Botha, Louis Coetzee

Publication date: 27 October 1998

Full work available at URL: https://doi.org/10.1002/(sici)1096-9128(199802)10:2<121::aid-cpe291>3.0.co;2-r

zbMATH Keywords

convergencerobustnessneural networksparallel computationunconstrained optimisationdownhill simplex algorithmheuristic optimisation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Parallel numerical computation (65Y05)

Related Items (1)

Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization

This page was built for publication: The parallel downhill simplex algorithm for unconstrained optimisation