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: Constrained multi-objective problems (CMOPs) are tricky, because it is difficult to handle multiple objectives and constraints simultaneously. Most existing algorithms perform well on CMOPs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results