Apply suggestions from code review

Co-authored-by: Lukas Devos <ldevos98@gmail.com>

Author: kellertuer

.gitignore

@@ -1,2 +1,3 @@
 docs/build
 docs/Manifest.toml
+Manifest.toml

docs/src/index.md

@@ -1,6 +1,6 @@
 # AlgorithmsInterface.jl
 
-Welcome to the Documentation of `LieGAlgorithmsInterface.jl`.
+Welcome to the Documentation of `AlgorithmsInterface.jl`.
 
 ```@meta
 CurrentModule = AlgorithmsInterface

docs/src/interface.md

@@ -6,16 +6,16 @@ The interface this package provides is based on three ingredients of running an
 consists of:
 
 * a [`Problem`](@ref) that is to be solved and contains all information that is algorithm independent.
-  This is _static information_ in the sense that it does not change during the runtime of the algorithm
+  This is _static information_ in the sense that it does not change during the runtime of the algorithm.
 * an [`Algorithm`](@ref) that includes all of the _settings_ and _parameters_ that an algorithm.
-  this is also information that is _static_
+  this is also information that is _static_.
 * a [`State`](@ref) that contains all remaining data, especially data that might vary during the iteration,
   temporary caches, for example the current iteration the algorithm run is in and the current iterate, respectively.
 
 The combination of the static information should be enough to initialize the varying data.
 
 This general scheme is a guiding principle of the package, splitting information into _static_
-or _configuration_ types or data that allows to [`initialize_state`](@ref) a correspondint _variable_ data type.
+or _configuration_ types or data that allows to [`initialize_state`](@ref) a corresponding _variable_ data type.
 
 The order of arguments is given by two ideas