Skip to content

Update benchmark; let block #559

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
PierreMartinon wants to merge 3 commits into
base: develop
Choose a base branch
from
Open

Update benchmark; let block #559

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
cc2cc36
bench update
PierreMartinon Feb 16, 2026
a8a6324
bench
PierreMartinon Feb 16, 2026
2970003
bench
PierreMartinon Feb 16, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions src/collocation.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -189,6 +189,7 @@ function (discretizer::Collocation)(ocp::AbstractModel)
)

return nlp

end

# Solution builder for ADNLPModels
Expand Down
15 changes: 9 additions & 6 deletions test/benchmark.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -204,6 +204,7 @@ function bench(;
target_list=:all,
grid_size_list=[250, 500, 1000],
solver=:ipopt,
timer=false,
return_sols=false,
save_sols=false,
kwargs...,
Expand All @@ -214,31 +215,32 @@ function bench(;
if target_list isa Symbol
target_list = target_dict[target_list]
end
verbose > 1 && println("Problem list: ", target_list)
verbose > 0 && println("Problem list: ", target_list)
problem_list = []
for problem_name in target_list
ocp_data = getfield(Main, Symbol(problem_name))()
push!(problem_list, ocp_data)
end

# solve problem list for all grid sizes
verbose > 1 && println("Grid size list: ", grid_size_list)
verbose > 0 && println("Grid size list: ", grid_size_list)
t_bench = zeros(Float64, (length(problem_list), length(grid_size_list)))
i_bench = zeros(Int, (length(problem_list), length(grid_size_list)))
s_bench = zeros(Bool, (length(problem_list), length(grid_size_list)))
solutions = Array{Any}(undef, (length(problem_list), length(grid_size_list)))
i = 1
for problem in problem_list
verbose > 1 && @printf("Testing problem %-20s: grid ", problem[:name])
verbose > 0 && @printf("Testing problem %s: ", problem[:name])
j = 1
for grid_size in grid_size_list
verbose > 1 && @printf("%d ", grid_size)
verbose > 0 && @printf("%d ", grid_size)
flush(stdout)
time, iter, success, sol = bench_problem(
problem;
grid_size=grid_size,
verbose=verbose-1,
solver=solver,
timer=timer,
kwargs...,
)
t_bench[i, j] = time
Expand All @@ -247,7 +249,7 @@ function bench(;
solutions[i, j] = sol
j = j + 1
end
verbose > 1 && println("")
verbose > 0 && print("\r\e[K")
i = i + 1
end

Expand All @@ -256,7 +258,7 @@ function bench(;
if verbose > 0
i = 1
for problem in problem_list
@printf("%-22s", problem[:name])
@printf("%-25s", problem[:name])
for j in 1:length(grid_size_list)
if s_bench[i, j]
@printf("%6.2f(%3d) ", t_bench[i, j], i_bench[i, j])
Expand All @@ -267,6 +269,7 @@ function bench(;
println("")
i = i + 1
end
println("")
end

# summary
Expand Down
Loading