Nelder–Mead with every trial point projected into the bounds. No convergence result: it can converge to a non-stationary point even of a smooth strictly convex function (McKinnon 1998). No integer coordinates.
Nelder–Mead with every trial point projected into the bounds. No convergence result: it can converge to a non-stationary point even of a smooth strictly convex function (McKinnon 1998). No integer coordinates.
Compass search, the simplest generalised pattern search: poll x ± Δᵢ·eᵢ, move to the first point that decreases f, halve every step when none does. It carries a partial convergence result — for a continuously differentiable f on a bounded set the steps go to zero at a stationary point (Kolda, Lewis and Torczon 2003) — and none for a non-smooth one, where it can stop at a point that is not a minimiser. Supports integer coordinates.
Compass search, the simplest generalised pattern search: poll x ± Δᵢ·eᵢ, move to the first point that decreases f, halve every step when none does. It carries a partial convergence result — for a continuously differentiable f on a bounded set the steps go to zero at a stationary point (Kolda, Lewis and Torczon 2003) — and none for a non-smooth one, where it can stop at a point that is not a minimiser. Supports integer coordinates.