You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/src/benchmark.md
+2Lines changed: 2 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,5 +1,7 @@
1
1
# Run a benchmark with OptimizationProblems.jl
2
2
3
+
> **Note:** When benchmarking, ensure that problems from ADNLP and PureJuMP implementations are strictly compatible (same initial point, bounds, constraints, and objective/constraint values within tolerance). Use meta fields for filtering and validation. Meta field completeness and accuracy are enforced by the test suite and are critical for reliable benchmarking.
4
+
3
5
In this more advanced tutorial, we use the problems from `OptimizationProblems` to run a benchmark for unconstrained problems.
4
6
The tutorial will use:
5
7
-[JSOSolvers](https://github.com/JuliaSmoothOptimizers/JSOSolvers.jl): This package provides optimization solvers in pure Julia for unconstrained and bound-constrained optimization.
0 commit comments