English

Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems

Optimization and Control 2026-03-31 v4 Differential Geometry

Abstract

In this paper, we study the asymptotic behavior of continuous- and discrete-time gradient flows of a ``lower-unbounded" convex function ff on a Hadamard manifold MM, particularly, their convergence properties to the boundary MM^{\infty} at infinity of MM. We establish a duality theorem that the infimum of the gradient-norm f(x)\|\nabla f(x)\| of ff over MM is equal to the supremum of the negative of the recession function ff^{\infty} of ff over the boundary MM^{\infty}, provided the infimum is positive. Further, the infimum and the supremum are obtained by the limit of the gradient flow of ff. Our results feature convex-optimization ingredients of the moment-weight inequality for reductive group actions by Georgoulas, Robbin, and Salamon, and are applied to noncommutative optimization by B\"urgisser et al. FOCS 2019. We show that gradient descent of the Kempf-Ness function for an unstable orbit converges to a destabilizing 1-parameter subgroup in the Hilbert-Mumford criterion, and the associated moment-map sequence converges to the minimum-norm point of the moment polytope. We show further refinements for operator scaling -- the left-right action on a matrix tuple A=(A1,A2,,AN)A= (A_1,A_2,\ldots,A_N). We characterize the gradient-flow limit of operator scaling by a vector-space generalization of the classical Dulmage-Mendelsohn decomposition of a bipartite graph. For a special case of N=2N = 2, we reveal that the limit determines the Kronecker canonical form of a matrix pencil sA1+A2s A_1+A_2.

Keywords

Cite

@article{arxiv.2404.09746,
  title  = {Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems},
  author = {Hiroshi Hirai and Keiya Sakabe},
  journal= {arXiv preprint arXiv:2404.09746},
  year   = {2026}
}

Comments

The conference version in FOCS 2024; to appear in Mathematics of Operations Research