diff --git a/docs/make.jl b/docs/make.jl
index c36f9eade1..a20a11a4d1 100644
--- a/docs/make.jl
+++ b/docs/make.jl
@@ -52,6 +52,7 @@ makedocs(;
         "https://github.com/devernay/cminpack/blob/d1f5f5a273862ca1bbcf58394e4ac060d9e22c76/hybrj.c",
         "https://github.com/devernay/cminpack/blob/d1f5f5a273862ca1bbcf58394e4ac060d9e22c76/lmder.c",
         "https://net-informations.com/faq/net/stack-heap.htm",  # Unreliable external site
+        "https://iopscience.iop.org/article/10.1088/1757-899X/1276/1/012010/",  # IOP redirects to PerimeterX bot validator from CI
     ],
     checkdocs = :exports,
     warnonly = [:missing_docs],
diff --git a/docs/src/solvers/bracketing_solvers.md b/docs/src/solvers/bracketing_solvers.md
index 42fc5f5570..b41d52fec7 100644
--- a/docs/src/solvers/bracketing_solvers.md
+++ b/docs/src/solvers/bracketing_solvers.md
@@ -8,7 +8,7 @@ Solves for ``f(t) = 0`` in the problem defined by `prob` using the algorithm `al
 algorithm is given, a default algorithm will be chosen.
 
 ## Recommended Methods
-[`modAB`](@ref) (Modified Anderson-Bjork) is the recommended method for the scalar interval 
+[`ModAB`](@ref) (Modified Anderson-Bjork) is the recommended method for the scalar interval 
 root-finding problems. It combines Bisection with Anderson-Bjork steps to achieve superlinear 
 convergence 1.7–1.8, providing optimal convergence rate for poorly behaved functions. 
 According to our benchmarks, it outperforms the other methods in most cases.