20.500.12556/RUL-180949 On the optimal parameter values of the Nelder–Mead simplex algorithm The paper outlines the derivation of optimal parameter values for the Nelder–Mead simplex algorithm as a function of the optimization problem’s dimension. The derivation applies to a general, strictly convex quadratic objective function, under the assumption that the simplex’s centroid probability density function within the ellipsoid defined by the simplex’s worst vertex is independent of the centroid’s distance to the worst vertex. The derived dependences of the Nelder–Mead simplex algorithm parameters show similarities with the heuristic solutions proposed so far. The algorithm’s performance, relative to its default parameter settings, was tested on a quadratic function in 10, 20, 50, and 100 dimensions. unconstrained optimization Nelder-Mead simplex algorithm high dimensions strictly convex quadratic function meta-optimization neomejena optimizacija Nelder-Meadov simpleksni postopek mnogo dimenzionalni prostor striktno konveksna kriterijska funkcija meta-optimizacija true false true Angleški jezik Slovenski jezik Članek v reviji 2026-03-20 11:10:51 2026-03-20 11:10:54 2026-03-23 03:49:50 0000-00-00 00:00:00 2026 0 0 18 str. [art. 117521 Vol. 484 1 Oct. 2026 0000-00-00 Zaloznikova Objavljeno apc 0000-00-00 0000-00-00 0000-00-00 004 0377-0427 10.1016/j.cam.2026.117521 272417283 1-s2.0-S0377042726001810-main.pdf 1-s2.0-S0377042726001810-main.pdf 1 9518BC49F9C0214DE90B9E3CB83E6881 f67651ab9c1cbaf7f11f7967a03ebd982c0e1a5c7da0827b17b8b5043a7d6f5c 64db6cea-244c-11f1-b0ab-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=230980 https://www.sciencedirect.com/science/article/pii/S0377042726001810 1 fe9efc02-2444-11f1-b0ab-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=230969 Fakulteta za elektrotehniko 0 0 0