The parallel downhill simplex algorithm for unconstrained optimisation

DOI10.1002/(SICI)1096-9128(199802)10:2%3C121::AID-CPE291%3E3.0.CO;2-RMaRDI QIDQ4208609zbMATH OpenOpenAlexFDO

Authors Louis Coetzee, Elizabeth C. Botha

Publication date 27 October 1998

Full work available at URL https://doi.org/10.1002/(sici)1096-9128(199802)10:2%3C121::aid-cpe291%3E3.0.co;2-r

zbMATH Keywords

convergencedownhill simplex algorithmheuristic optimisation algorithmneural networksparallel computationrobustnessunconstrained optimisation

Mathematics Subject Classification ID

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

Recommendations

• A parallel implementation of the simplex function minimization routine
• Direct Search Methods on Parallel Machines
• scientific article; zbMATH DE number 1948447
• A General-Purpose Parallel Algorithm for Unconstrained Optimization

Cited in

(4)

• scientific article; zbMATH DE number 140606 (Why is no real title available?)
• Algorithm 711: BTN: software for parallel unconstrained optimization
• A three-level parallelisation scheme and application to the Nelder-Mead algorithm
• Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208609)