Manopt.jl: Optimization on Manifolds in Julia
Journal article, Peer reviewed
Published version

View/ Open
Date
2022Metadata
Show full item recordCollections
- Institutt for matematiske fag [2601]
- Publikasjoner fra CRIStin - NTNU [39811]
Original version
10.21105/joss.03866Abstract
Manopt.jl provides a set of optimization algorithms for optimization problems given on a Riemannian manifold M. Based on a generic optimization framework, together with the interface ManifoldsBase.jl for Riemannian manifolds, classical and recently developed methods are provided in an efficient implementation. Algorithms include the derivative-free Particle Swarm and Nelder–Mead algorithms, as well as classical gradient, conjugate gradient and stochastic gradient descent. Furthermore, quasi-Newton methods like a Riemannian L-BFGS and nonsmooth optimization algorithms like a Cyclic Proximal Point Algorithm, a (parallel) Douglas-Rachford algorithm and a Chambolle-Pock algorithm are provided, together with several basic cost functions, gradients and proximal maps as well as debug and record capabilities. Manopt.jl: Optimization on Manifolds in Julia