|
| 1 | +using Pkg; |
| 2 | +Pkg.activate("paper"); |
| 3 | +using JLD2, Plots, SolverBenchmark, DataFrames |
| 4 | + |
| 5 | +name = "2022-05-16_ST_TROp_ARCqKOpShift05_cutest_277_1000000" |
| 6 | +@load "paper/$name.jld2" stats |
| 7 | + |
| 8 | +solved(df) = (df.status .== :first_order) .| (df.status .== :unbounded) |
| 9 | + |
| 10 | +for solver in keys(stats) |
| 11 | + open("paper/$(name)_result_$(solver).dat", "w") do io |
| 12 | + print( |
| 13 | + io, |
| 14 | + stats[solver][ |
| 15 | + !, |
| 16 | + [ |
| 17 | + :name, |
| 18 | + :nvar, |
| 19 | + # :ncon, |
| 20 | + :status, |
| 21 | + :objective, |
| 22 | + :elapsed_time, |
| 23 | + :iter, |
| 24 | + # :primal_feas, |
| 25 | + :dual_feas, |
| 26 | + :neval_obj, |
| 27 | + :neval_grad, |
| 28 | + :neval_hprod, |
| 29 | + :neval_hess, |
| 30 | + ], |
| 31 | + ], |
| 32 | + ) |
| 33 | + end |
| 34 | +end |
| 35 | + |
| 36 | +nmins = [0, 100, 1000, 10000] |
| 37 | +for nmin in nmins |
| 38 | + # Same figure with minimum number of variables |
| 39 | + stats2 = copy(stats) |
| 40 | + for solver in keys(stats) |
| 41 | + stats2[solver] = stats[solver][stats[solver].nvar.>=nmin, :] |
| 42 | + end |
| 43 | + |
| 44 | + nb_problems = length(stats2[first(keys(stats))][!, :name]) |
| 45 | + |
| 46 | + # Figures comparing two results: |
| 47 | + costs_all = [ |
| 48 | + df -> .!solved(df) * Inf + df.elapsed_time, |
| 49 | + df -> .!solved(df) * Inf + df.neval_obj, |
| 50 | + df -> .!solved(df) * Inf + df.neval_grad, |
| 51 | + df -> .!solved(df) * Inf + df.neval_hprod, |
| 52 | + ] |
| 53 | + costnames_all = [ |
| 54 | + "elapsed time", |
| 55 | + "objective evals", |
| 56 | + "gradient evals", |
| 57 | + "hessian-vector products", |
| 58 | + ] |
| 59 | + p = profile_solvers(stats2, costs_all, costnames_all, height = 400, width = 400, margin=5Plots.mm) |
| 60 | + png(p, "paper/$(name)_all($(nb_problems))_min_$(nmin)") |
| 61 | +end |
0 commit comments