a vale check.

JuliaManifolds · Sep 4, 2024 · f242431 · f242431
1 parent d0f3aad
commit f242431
Show file tree

Hide file tree

Showing 5 changed files with 5 additions and 5 deletions.
diff --git a/docs/src/about.md b/docs/src/about.md
@@ -12,7 +12,7 @@ Thanks to the following contributors to `Manopt.jl`:
 * [Willem Diepeveen](https://www.maths.cam.ac.uk/person/wd292) implemented the [primal-dual Riemannian semismooth Newton](solvers/primal_dual_semismooth_Newton.md) solver.
 * [Hajg Jasa](https://www.ntnu.edu/employees/hajg.jasa) implemented the [convex bundle method](solvers/convex_bundle_method.md) and the [proximal bundle method](solvers/proximal_bundle_method.md) and a default subsolver each of them.
 * Even Stephansen Kjemsås contributed to the implementation of the [Frank Wolfe Method](solvers/FrankWolfe.md) solver.
-* Mathias Ravn Munkvold contributed most of the implementation of the [Adaptive Regularization with Cubics](solvers/adaptive-regularization-with-cubics.md) solver as well as ist [Lanczos](@ref arc-Lanczos) subsolver
+* Mathias Ravn Munkvold contributed most of the implementation of the [Adaptive Regularization with Cubics](solvers/adaptive-regularization-with-cubics.md) solver as well as its [Lanczos](@ref arc-Lanczos) subsolver
 * [Tom-Christian Riemer](https://www.tu-chemnitz.de/mathematik/wire/mitarbeiter.php) implemented the [trust regions](solvers/trust_regions.md) and [quasi Newton](solvers/quasi_Newton.md) solvers as well as the [truncated conjugate gradient descent](solvers/truncated_conjugate_gradient_descent.md) subsolver.
 * [Markus A. Stokkenes](https://www.linkedin.com/in/markus-a-stokkenes-b41bba17b/) contributed most of the implementation of the [Interior Point Newton Method](solvers/interior_point_Newton.md) as well as its default [Conjugate Residual](solvers/conjugate_residual.md) subsolver
 * [Manuel Weiss](https://scoop.iwr.uni-heidelberg.de/author/manuel-weiß/) implemented most of the [conjugate gradient update rules](@ref cg-coeffs)

diff --git a/docs/src/plans/stepsize.md b/docs/src/plans/stepsize.md
@@ -37,7 +37,7 @@ Tangent bundle with the Sasaki metric has 0 injectivity radius, so the maximum s
 `Hyperrectangle` also has 0 injectivity radius and an estimate based on maximum of dimensions along each index is used instead.
 For manifolds with corners, however, a line search capable of handling break points along the projected search direction should be used, and such algorithms do not call `max_stepsize`.
 
-Internally the step size functions above create a [`ManifoldDefaultsFactory`](@ref).
+Internally these step size functions create a [`ManifoldDefaultsFactory`](@ref).
 Internally these use
 
 ```@autodocs

diff --git a/docs/src/solvers/conjugate_gradient_descent.md b/docs/src/solvers/conjugate_gradient_descent.md
@@ -32,7 +32,7 @@ PolakRibiereCoefficient
 SteepestDescentCoefficient
 ```
 
-## Internal rule storages
+## Internal rules for coefficients
 
 ```@docs
 Manopt.ConjugateGradientBealeRestartRule

diff --git a/docs/src/solvers/proximal_point.md b/docs/src/solvers/proximal_point.md
@@ -1,4 +1,4 @@
-# Proximal Point Method
+# Proximal point method
 
 ```@meta
 CurrentModule = Manopt

diff --git a/src/plans/record.jl b/src/plans/record.jl
@@ -523,7 +523,7 @@ $(_var(:Keyword, :inverse_retraction_method))
         storage                   = StoreStateAction(M; store_points=Tuple{:Iterate})
     )
 
-with the preceding fields as keywords. For the `DefaultManifold` only the field storage is used.
+with the previous fields as keywords. For the `DefaultManifold` only the field storage is used.
 Providing the actual manifold moves the default storage to the efficient point storage.
 """
 mutable struct RecordChange{