A Euclidean Quasi-Newton Method for Matrix-Manifold Optimization via Almost-Global Coordinates

We study smooth matrix-manifold optimization using objective values and first derivatives. Almost-global coordinates transform the manifold-constrained problem into an unconstrained pullback problem, to which we apply BFGS with a chart-restart strategy and a limited-memory implementation. We establish correspondence of first- and second-order stationary points and minimizers, together with conditional convergence and local q-superlinear convergence. The local rate follows from Euclidean full-memory BFGS theory once the chart is fixed, without the locking condition required by classical transported-gradient Riemannian BFGS analyses. Tests on 15 benchmark problems from Manopt and Pymanopt, with ten instances per problem, show that our limited-memory method solves all 150 cases, whereas Riemannian BFGS and Riemannian steepest descent solve 132 and 117 cases, respectively. On the 115 cases successfully solved by all three methods, our method takes roughly half the time of either baseline, measured by geometric-mean solve time.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24101
Primary Topic
Advanced Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Euclidean Quasi-Newton Method for Matrix-Manifold Optimization via Almost-Global Coordinates

李炳杰, Ziang Tian, Zhigang Yao, Jiang Hu
arXiv (Cornell University)
Advanced Optimization Algorithms Research
preprint

A Euclidean Quasi-Newton Method for Matrix-Manifold Optimization via Almost-Global Coordinates

李炳杰, Ziang Tian, Zhigang Yao, Jiang Hu
preprint en

Abstract

We study smooth matrix-manifold optimization using objective values and first derivatives. Almost-global coordinates transform the manifold-constrained problem into an unconstrained pullback problem, to which we apply BFGS with a chart-restart strategy and a limited-memory implementation. We establish correspondence of first- and second-order stationary points and minimizers, together with conditional convergence and local q-superlinear convergence. The local rate follows from Euclidean full-memory BFGS theory once the chart is fixed, without the locking condition required by classical transported-gradient Riemannian BFGS analyses. Tests on 15 benchmark problems from Manopt and Pymanopt, with ten instances per problem, show that our limited-memory method solves all 150 cases, whereas Riemannian BFGS and Riemannian steepest descent solve 132 and 117 cases, respectively. On the 115 cases successfully solved by all three methods, our method takes roughly half the time of either baseline, measured by geometric-mean solve time.

arXiv (Cornell University)
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon