Papers › Preconditioned Low-Rank Riemannian Optimization for Symmetric Positive Definite Linear...

Preconditioned Low-Rank Riemannian Optimization for Symmetric Positive Definite Linear Matrix Equations

29 Aug 2024arXiv:2408.16416links table onlyarchive 2025-07-28

Ivan Bioli, Daniel Kressner, Leonardo Robol

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This work is concerned with the numerical solution of large-scale symmetric positive definite matrix equations of the form A₁XB₁^⊤ + A₂XB₂^⊤ + …+ A_ℓ X B_ℓ^⊤ = F, as they arise from discretized partial differential equations and control problems. One often finds that X admits good low-rank approximations, in particular when the right-hand side matrix F has low rank. For ℓ≤2 terms, the solution of such equations is well studied and effective low-rank solvers have been proposed, including Alternating Direction Implicit (ADI) methods for Lyapunov and Sylvester equations. For ℓ> 2, several existing methods try to approach X through combining a classical iterative method, such as the conjugate gradient (CG) method, with low-rank truncation. In this work, we consider a more direct approach that approximates X on manifolds of fixed-rank matrices through Riemannian CG. One particular challenge is the incorporation of effective preconditioners into such a first-order Riemannian optimization method. We propose several novel preconditioning strategies, including a change of metric in the ambient space, preconditioning the Riemannian gradient, and a variant of ADI on the tangent space. Combined with a strategy for adapting the rank of the approximation, the resulting method is demonstrated to be competitive for a number of examples representative for typical applications.

PaperPDFCode

Code

IvanBioli/riemannian-spdmatrixeq officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections