A Riemannian optimization method on fixed-rank matrix manifolds computes low-rank approximations to the solutions of parametrized systems, extending from linear to nonlinear cases with theoretical support for low-rank structure and preconditioning strategies.
The conjugate gradient method and trust regions in large scale optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
SciPy 1.0 documents a mature open-source library that has become the de facto standard for scientific algorithms in Python with broad adoption across research projects.
citing papers explorer
-
Low-rank solutions to a class of parametrized systems using Riemannian optimization
A Riemannian optimization method on fixed-rank matrix manifolds computes low-rank approximations to the solutions of parametrized systems, extending from linear to nonlinear cases with theoretical support for low-rank structure and preconditioning strategies.
-
SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
SciPy 1.0 documents a mature open-source library that has become the de facto standard for scientific algorithms in Python with broad adoption across research projects.