Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.
Abstract: Robust multiobjective optimization problems (RMOPs) widely exist in real-world applications, which introduce a variety of uncertainty in optimization models. While some evolutionary ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results