Update link to list of solvers (#273)

blegat · web-flow · commit a69db10a445d · 2023-02-16T12:08:36.000+01:00
diff --git a/docs/src/tutorials/Extension/certificate.jl b/docs/src/tutorials/Extension/certificate.jl
@@ -22,7 +22,7 @@ using SumOfSquares
 S = @set x >= 0 && y >= 0 && x^2 + y^2 >= 2
 
 # We will now see how to find the optimal solution using Sum of Squares Programming.
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 import CSDP
 solver = optimizer_with_attributes(CSDP.Optimizer, MOI.Silent() => true)
diff --git a/docs/src/tutorials/Extension/hypercube.jl b/docs/src/tutorials/Extension/hypercube.jl
@@ -32,7 +32,7 @@ using SumOfSquares
 S = algebraicset([xi^2 - 1 for xi in x])
 
 # We will now search for the minimum of `x` over `S` using Sum of Squares Programming.
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 import CSDP
 solver = optimizer_with_attributes(CSDP.Optimizer, MOI.Silent() => true)
diff --git a/docs/src/tutorials/Getting started/circle.jl b/docs/src/tutorials/Getting started/circle.jl
@@ -12,7 +12,7 @@ using SumOfSquares
 @polyvar x y
 S = @set x^2 + y^2 == 1
 
-# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.23.0/installation/#Supported-solvers) for a list of the available choices.
+# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 # The domain over which the nonnegativity of ``1 - y^2`` should be certified
 # is specified through the `domain` keyword argument.
 
diff --git a/docs/src/tutorials/Getting started/getting_started.jl b/docs/src/tutorials/Getting started/getting_started.jl
@@ -13,7 +13,7 @@ using DynamicPolynomials
 @polyvar x y
 p = 2*x^4 + 2*x^3*y - x^2*y^2 + 5*y^4
 
-# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 # We use `SOSModel` instead of `Model` to be able to use the `>=` syntax for Sum-of-Squares constraints.
 
 using SumOfSquares
diff --git a/docs/src/tutorials/Getting started/motzkin.jl b/docs/src/tutorials/Getting started/motzkin.jl
@@ -20,7 +20,7 @@ using DynamicPolynomials
 motzkin = x^4*y^2 + x^2*y^4 + 1 - 3x^2*y^2
 
 # The Motzkin polynomial is nonnegative but is not a sum of squares as we can verify numerically as follows.
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 using SumOfSquares
 import CSDP
diff --git a/docs/src/tutorials/Getting started/sum-of-squares_matrices.jl b/docs/src/tutorials/Getting started/sum-of-squares_matrices.jl
@@ -30,7 +30,7 @@ P = [x^2 - 2x + 2 x
 
 using SumOfSquares
 
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 import CSDP
 solver = optimizer_with_attributes(CSDP.Optimizer, MOI.Silent() => true)
diff --git a/docs/src/tutorials/Noncommutative and Hermitian/noncommutative_variables.jl b/docs/src/tutorials/Noncommutative and Hermitian/noncommutative_variables.jl
@@ -18,7 +18,7 @@ using DynamicPolynomials
 @ncpolyvar x y
 p = (x * y + x^2)^2
 
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 using SumOfSquares
 import CSDP
diff --git a/docs/src/tutorials/Other Applications/bounds_in_probability.jl b/docs/src/tutorials/Other Applications/bounds_in_probability.jl
@@ -30,7 +30,7 @@ monos = [1, x, x^2]
 using SumOfSquares
 μ = measure([μ0, μ1, μ2], monos)
 
-# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 # We use `SOSModel` instead of `Model` to be able to use the `>=` syntax for Sum-of-Squares constraints.
 
 using CSDP
diff --git a/docs/src/tutorials/Polynomial Optimization/bound_on_global_extremum.jl b/docs/src/tutorials/Polynomial Optimization/bound_on_global_extremum.jl
@@ -16,7 +16,7 @@ f3 = 2x1 - 3x2
 f4 = 18 - 32x1 + 12x1^2 + 48x2 - 36x1*x2 + 27x2^2
 f = (1 + f1^2 * f2) * (30 + f3^2 * f4)
 
-# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 # We use `SOSModel` instead of `Model` to be able to use the `>=` syntax for Sum-of-Squares constraints.
 
 using SumOfSquares
diff --git a/docs/src/tutorials/Polynomial Optimization/extracting_minimizers.jl b/docs/src/tutorials/Polynomial Optimization/extracting_minimizers.jl
@@ -26,7 +26,7 @@ using SumOfSquares
 K = @set x[1] >= 0 && x[1] <= 3 && x[2] >= 0 && x[2] <= 4 && x[2] <= 2x[1]^4 - 8x[1]^3 + 8x[1]^2 + 2 && x[2] <= 4x[1]^4 - 32x[1]^3 + 88x[1]^2 - 96x[1] + 36
 
 # We will now see how to find the optimal solution using Sum of Squares Programming.
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 import CSDP
 solver = optimizer_with_attributes(CSDP.Optimizer, MOI.Silent() => true)
diff --git a/docs/src/tutorials/Polynomial Optimization/polynomial_optimization.jl b/docs/src/tutorials/Polynomial Optimization/polynomial_optimization.jl
@@ -63,7 +63,7 @@ optimize!(model)
 ## Sum-of-Squares approach
 
 # We will now see how to find the optimal solution using Sum of Squares Programming.
-# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We first need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 
 import CSDP
 solver = optimizer_with_attributes(CSDP.Optimizer, MOI.Silent() => true)
diff --git a/docs/src/tutorials/Systems and Control/lyapunov_function_search.jl b/docs/src/tutorials/Systems and Control/lyapunov_function_search.jl
@@ -14,7 +14,7 @@ f = [-x[1]^3 - x[1] * x[3]^2,
      -x[2] - x[1]^2 * x[2],
      -x[3] - 3x[3] / (x[3]^2 + 1) + 3x[1]^2 * x[3]]
 
-# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v0.21.6/installation/#Supported-solvers) for a list of the available choices.
+# We need to pick an SDP solver, see [here](https://jump.dev/JuMP.jl/v1.8/installation/#Supported-solvers) for a list of the available choices.
 # We use `SOSModel` instead of `Model` to be able to use the `>=` syntax for Sum-of-Squares constraints.
 
 using SumOfSquares
