Fix DocumenterCitations.

docs/src/helpers/checks.md

@@ -10,6 +10,6 @@ Pages   = ["checks.jl"]
 ## Literature
 
 ```@bibliography
-Pages = ["helpers/checks.md"]
+Pages = ["checks.md"]
 Canonical=false
 ```

docs/src/helpers/data.md

@@ -13,6 +13,6 @@ Pages   = ["artificialDataFunctions.jl"]
 # Literature
 
 ```@bibliography
-Pages = ["helpers/data.md"]
+Pages = ["data.md"]
 Canonical=false
 ```

docs/src/plans/stepsize.md

@@ -29,6 +29,6 @@ Filter = t -> t != Stepsize
 ## Literature
 
 ```@bibliography
-Pages = ["plans/stepsize.md"]
+Pages = ["stepsize.md"]
 Canonical=false
 ```

docs/src/references.bib

@@ -203,7 +203,7 @@ @book{Boumal:2023
     EDITION   = {First},
     PUBLISHER = {Cambridge University Press},
     DOI       = {10.1017/9781009166164},
-    URLDATE   = {2023-07-13},
+    NOTE      = {Homepage to the book: {https://www.nicolasboumal.net/book/index.html}(nicolasboumal.net/book/index.html).},
     ABSTRACT  = {Optimization on Riemannian manifolds-the result of smooth geometry and optimization merging into one elegant modern framework-spans many areas of science and engineering, including machine learning, computer vision, signal processing, dynamical systems and scientific computing. This text introduces the differential geometry and Riemannian geometry concepts that will help students and researchers in applied mathematics, computer science and engineering gain a firm mathematical grounding to use these tools confidently in their research. Its charts-last approach will prove more intuitive from an optimizer's viewpoint, and all definitions and theorems are motivated to build time-tested optimization algorithms. Starting from first principles, the text goes on to cover current research on topics including worst-case complexity and geodesic convexity. Readers will appreciate the tricks of the trade for conducting research and for numerical implementations sprinkled throughout the book.},
     ISBN      = {978-1-00-916616-4}
 }

docs/src/solvers/ChambollePock.md

@@ -115,4 +115,4 @@ Manopt.update_prox_parameters!
 ```@bibliography
 Pages = ["ChambollePock.md"]
 Canonical=false
-```
+```

docs/src/solvers/FrankWolfe.md

@@ -27,4 +27,4 @@ FrankWolfeGradient
 ```@bibliography
 Pages = ["FrankWolfe.md"]
 Canonical=false
-```
+```

docs/src/solvers/LevenbergMarquardt.md

@@ -20,4 +20,4 @@ LevenbergMarquardtState
 ```@bibliography
 Pages = ["LevenbergMarquardt.md"]
 Canonical=false
-```
+```

docs/src/solvers/augmented_Lagrangian_method.md

@@ -27,4 +27,4 @@ AugmentedLagrangianGrad
 ```@bibliography
 Pages = ["augmented_Lagrangian_method.md"]
 Canonical=false
-```
+```

docs/src/solvers/conjugate_gradient_descent.md

@@ -37,4 +37,4 @@ SteepestDirectionUpdateRule
 ```@bibliography
 Pages = ["conjugate_gradient_descent.md"]
 Canonical=false
-```
+```

docs/src/solvers/exact_penalty_method.md

@@ -31,4 +31,4 @@ LogarithmicSumOfExponentials
 ```@bibliography
 Pages = ["exact_penalty_method.md"]
 Canonical=false
-```
+```

docs/src/solvers/particle_swarm.md

@@ -20,4 +20,4 @@ ParticleSwarmState
 ```@bibliography
 Pages = ["particle_swarm.md"]
 Canonical=false
-```
+```

docs/src/solvers/primal_dual_semismooth_Newton.md

@@ -77,4 +77,4 @@ PrimalDualSemismoothNewtonState
 ```@bibliography
 Pages = ["primal_dual_semismooth_Newton.md"]
 Canonical=false
-```
+```

docs/src/solvers/quasi_Newton.md

@@ -117,4 +117,4 @@ QuasiNewtonState
 ```@bibliography
 Pages = ["quasi_Newton.md"]
 Canonical=false
-```
+```

docs/src/solvers/truncated_conjugate_gradient_descent.md

@@ -49,4 +49,4 @@ TrustRegionModelObjective
 ```@bibliography
 Pages = ["truncated_conjugate_gradient_descent.md"]
 Canonical=false
-```
+```

docs/src/solvers/trust_regions.md

@@ -64,4 +64,4 @@ Manopt.AbstractApproxHessian
 ```@bibliography
 Pages = ["trust_regions.md"]
 Canonical=false
-```
+```

docs/src/tutorials/GeodesicRegression.md

@@ -514,7 +514,6 @@ Note that the geodesics from the data to the regression geodesic meet at a nearl
 ## Literature
 
 ```@bibliography
-Pages = ["tutorials/GeodesicRegression.md"]
+Pages = ["GeodesicRegression.md"]
 Canonical=false
 ```
-