The mean performance of stochastic optimization algorithms may not average

DOI10.1007/S40314-026-03647-YMaRDI QIDQ7291488zbMATH OpenFDO

Authors Yuan Yan, Qunfeng Liu, Yun Li

Publication date 7 July 2026

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-026-03647-Y

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Nonlinear programming (90C30)

Cites work

• A Simplex Method for Function Minimization
• Benchmarking Derivative-Free Optimization Algorithms
• Benchmarking optimization software with performance profiles.
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Genetic Algorithms and the Optimal Allocation of Trials
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• Mean-based Borda count for paradox-free comparisons of optimization algorithms
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
• Optimization by Direct Search in Matrix Computations
• Particle Swarm Optimization

This page was built for publication: The mean performance of stochastic optimization algorithms may not average

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