@@ -13,23 +13,23 @@ ensembleprob = Optimization.EnsembleProblem(
1313
1414sol = Optimization. solve (ensembleprob, OptimizationOptimJL. BFGS (),
1515 EnsembleThreads (), trajectories = 4 , maxiters = 5 )
16- @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] < sol1. objective
16+ @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] <= sol1. objective
1717
1818sol = Optimization. solve (ensembleprob, OptimizationOptimJL. BFGS (),
1919 EnsembleDistributed (), trajectories = 4 , maxiters = 5 )
20- @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] < sol1. objective
20+ @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] <= sol1. objective
2121
2222prob = OptimizationProblem (optf, x0, lb = [- 0.5 , - 0.5 ], ub = [0.5 , 0.5 ])
2323ensembleprob = Optimization. EnsembleProblem (
2424 prob, prob_func = (prob, i, repeat) -> remake (prob, u0 = rand (- 0.5 : 0.001 : 0.5 , 2 )))
2525
2626sol = Optimization. solve (ensembleprob, OptimizationOptimJL. BFGS (),
2727 EnsembleThreads (), trajectories = 5 , maxiters = 5 )
28- @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] < sol1. objective
28+ @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] <= sol1. objective
2929
3030sol = Optimization. solve (ensembleprob, OptimizationOptimJL. BFGS (),
3131 EnsembleDistributed (), trajectories = 5 , maxiters = 5 )
32- @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] < sol1. objective
32+ @test findmin (i -> sol. u[i]. objective, 1 : 4 )[1 ] <= sol1. objective
3333
3434using NonlinearSolve
3535
0 commit comments