Incorrect result when set of minimisers

[dpsanders]

julia> @time ibc_minimise((x,y)->(x-y)^2, IntervalBox(2..4, 3..4), tol=1e-6)
  0.471267 seconds (1.18 M allocations: 60.234 MiB, 4.10% gc time)
([0, 0], IntervalBox{2,Float64}[[3.99999, 4] × [3.99999, 4], [3.99999, 4] × [3.99999, 4], [3.99999, 4] × [3.99999, 4], [3.99999, 4] × [3.99999, 4]])

Any (x, x) in (3..4) \times (3..4) should be a solution.

[dpsanders]

Unless you are trying to return only a solution instead of all solutions.

[yashvardhan747]

Yes the solution will be convex hull of all minimisers.

[dpsanders]

That is not what is happening here? Why will it be the convex Hull? The easiest thing to do is just return a list of all the boxes that may contain minimisers.

[yashvardhan747]

I said convex Hull because from it we can find smallest box which can all the minimisers.