Pith. sign in

REVIEW 2 cited by

Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1603.03236 v4 pith:AYP2OS65 submitted 2016-03-10 cs.MS cs.LGmath.OCstat.ML

classification cs.MScs.LGmath.OCstat.ML
keywords optimizationmanifoldspymanoptcalculationconstraintsdifferentiationmanifoldmethods
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Optimization on manifolds is a class of methods for optimization of an objective function, subject to constraints which are smooth, in the sense that the set of points which satisfy the constraints admits the structure of a differentiable manifold. While many optimization problems are of the described form, technicalities of differential geometry and the laborious calculation of derivatives pose a significant barrier for experimenting with these methods. We introduce Pymanopt (available at https://pymanopt.github.io), a toolbox for optimization on manifolds, implemented in Python, that---similarly to the Manopt Matlab toolbox---implements several manifold geometries and optimization algorithms. Moreover, we lower the barriers to users further by using automated differentiation for calculating derivative information, saving users time and saving them from potential calculation and implementation errors.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 108 citations worldwide. Full citation record

  1. Nonconvex optimization methods for ground states in disordered continuous-spin models

    math.OC 2026-05 unverdicted novelty 4.0 of 10

    On the random-field XY model, Riemannian Monotonic Basin Hopping finds lower-energy states than MultiStart at lower computational cost in the tested L=10–32 instances.

  2. A Flag Decomposition for Hierarchical Datasets

    cs.CV 2025-02 conditional novelty 4.0 of 10

    The Flag Decomposition factors a matrix with a nested column hierarchy into an orthonormal flag, a block upper triangular matrix, and a permutation, computed by a block Gram-Schmidt algorithm.

Pith tools