The following algorithms can be called with their parameters and optional
values given in the usual Matlab way (a string, value alternating list).
Then a parser is called and might perform additional validity checks.
The second possibility is to defined a struct
, e.g. with the field
1
problem.M = Sn(2);
for data on the twodimensional sphere. This does not evoke the parser and might include less validity checks. It should be preferred when performing a set of experiments.
 The CPP algorithm for first and second order TV

This algorithm computes the cyclic or randomized proximal point algorithm on a manifold for the first and second order TV additive coupling functional.
more  The CPP algorithm for Huber relaxed TV

This algorithm computes the cyclic or randomized proximal point algorithm on a manifold for the first order differences relaxed by a Huber functional.
more  The Cyclic Proximal Point Algorithm

This algorithm computes the cyclic or randomized proximal point algorithm on a manifold for given input data , where denotes the data domain â€”usually a signal or pixel grid, but necessarily on some array formâ€”, a set of proximal maps, and a stopping criterion.
more  The gradient descent algorithm on a manifold

Based on a manifold , a starting point , and a gradient (or descent) direction of a function this function performs a gradient descent algorithm
with step size , until a stopping criterion is fulfilled.
more  The subgradient descent algorithm on a manifold

Based on a manifold , a starting point , and an element from the (sub)gradient (or descent) direction of a function this function performs a subgradient descent algorithm %}
with step sizes , where we keep track of the minimal value . If is not single valued, this algorithm assumes, that it is meant as a parallel subgradient algorithm with respect to the last dimension(s) of .
more