Manopt.jl – Optimization on Manifolds in Julia.
For a function $f\colon\mathcal M \to \mathbb R$ defined on a Riemannian manifold $\mathcal M$ we aim to solve
or in other words: find the point $x$ on the manifold, where $f$ reaches its minimal function value.
Manopt.jl provides a framework for optimization on manifolds. Based on Manopt and MVIRT, both implemented in Matlab, this toolbox provide an easy access to optimization methods on manifolds for Julia, including example data and visualization methods.
If you want to delve right into
Manopt.jl check out the Getting Started: Optimize! tutorial.
Manopt.jl makes it easy to use an algorithm for your favorite manifold as well as a manifold for your favorite algorithm. It already provides many manifolds and algorithms, which can easily be enhanced, for example to record certain data or display information throughout iterations.
For every optimization algorithm, a solver is implemented based on a
Problem that describes the problem to solve and its
Options that set up the solver, store interims values. Together they form a plan.
To visualize and interpret results,
Manopt.jl aims to provide both easy plot functions as well as exports. Furthermore a system to get debug during the iterations of an algorithms as well as record capabilities, i.e. to record a specified tuple of values per iteration, most prominently
RecordIterate. Take a look at the Getting Started: Optimize! tutorial how to easily activate this.
This project is build upon ManifoldsBase.jl, a generic interface to implement manifolds. Certain functions are extended for specific manifolds from Manifolds.jl, but all other manifolds from that package can be used here, too.
The notation in the documentation aims to follow the same notation from these packages.
If you want to get started with manifolds, one book is [do Carmo, 1992], and if you want do directly dive into optimization on manifolds, my favourite reference is [Absil, Mahony, Sepulchre, 2008], which is also available online for free.