Gradient descent for unbounded convex functions on Hadamard manifolds and its applications to scaling problems (2404.09746v2)
Abstract: In this paper, we study asymptotic behaviors of continuous-time and discrete-time gradient flows of a ``lower-unbounded" convex function $f$ on a Hadamard manifold $M$, particularly, their convergence properties to the boundary $M{\infty}$ at infinity of $M$. We establish a duality theorem that the infimum of the gradient-norm $|\nabla f(x)|$ of $f$ over $M$ is equal to the supremum of the negative of the recession function $f{\infty}$ of $f$ over the boundary $M{\infty}$, provided the infimum is positive. Further, the infimum and the supremum are obtained by the limits of the gradient flows of $f$, 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 the gradient descent of the Kempf-Ness function for an unstable orbit converges to a 1-parameter subgroup in the Hilbert-Mumford criterion, and the associated moment-map sequence converges to the mimimum-norm point of the moment polytope. We show further refinements for operator scaling -- the left-right action on a matrix tuple $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. Also, for a special case of $N = 2$, we reveal that this limit determines the Kronecker canonical form of matrix pencils $s A_1+A_2$.
- Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pages 172–181. ACM, 2018.
- Hessian Riemannian gradient flows in convex programming. SIAM J. Control Optim., 43(2):477–501, 2004.
- A. Auslender. How to deal with the unbounded in optimization: theory and algorithms. Math. Programming, 79(1-3):3–18, 1997.
- M. Bačák. Convex Analysis and Optimization in Hadamard Spaces. De Gruyter, Berlin, 2014.
- A. Beck. First-Order Methods in Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2017.
- T. Berger and S. Trenn. The quasi-Kronecker form for matrix pencils. SIAM J. Matrix Anal. Appl., 33(2):336–368, 2012.
- N. Boumal. An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, Cambridge, 2023.
- M. R. Bridson and A. Haefliger. Metric Spaces of Non-Positive Curvature. Springer-Verlag, Berlin, 1999.
- Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pages 883–897, 2018.
- Towards a theory of non-commutative optimization: geodesic 1st and 2nd order methods for moment maps and polytopes. In 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pages 845–861, 2019.
- Interior-point methods for unconstrained geometric programming and scaling problems. arXiv:2008.12110, 2020.
- P.-E. Caprace and A. Lytchak. At infinity of finite-dimensional CAT(0) spaces. Math. Ann., 346(1):1–21, 2010.
- X. Chen and S. Sun. Calabi flow, geodesic rays, and uniqueness of constant scalar curvature Kähler metrics. Ann. of Math. (2), 180(2):407–454, 2014.
- J. Demmel and B. K\aragström. The generalized Schur decomposition of an arbitrary pencil A−λB𝐴𝜆𝐵A-\lambda Bitalic_A - italic_λ italic_B: robust software with error bounds and applications. I. Theory and algorithms. ACM Trans. Math. Software, 19(2):160–174, 1993.
- Coverings of bipartite graphs. Canadian J. Math., 10:517–534, 1958.
- C. Franks. Operator scaling with specified marginals. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 190–203. ACM, New York, 2018.
- Shrunk subspaces via operator Sinkhorn iteration. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1655–1668. SIAM, Philadelphia, PA, 2023.
- F. R. Gantmacher. The Theory of Matrices. Vols. 1, 2. Chelsea Publishing Co., New York, 1959.
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. Geom. Funct. Anal., 28(1):100–145, 2018.
- Operator scaling: theory and applications. Found. Comput. Math., 20(2):223–290, 2020.
- A. Garg and R. Oliveira. Recent progress on scaling algorithms and applications. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, (125):14–49, 2018.
- The Moment-Weight Inequality and the Hilbert-Mumford Criterion—GIT from the Differential Geometric Viewpoint, volume 2297 of Lecture Notes in Mathematics. Springer, Cham, 2021.
- V. Guillemin and S. Sternberg. Convexity properties of the moment mapping. II. Invent. Math., 77(3):533–546, 1984.
- L. Gurvits. Classical complexity and quantum entanglement. J. Comput. System Sci., 69(3):448–484, 2004.
- M. Hamada and H. Hirai. Computing the nc-rank via discrete convex optimization on CAT(0)CAT0{\rm CAT}(0)roman_CAT ( 0 ) spaces. SIAM J. Appl. Algebra Geom., 5(3):455–478, 2021.
- Finding Hall blockers by matrix scaling. Mathematics of Operations Research. to appear.
- H. Hirai. Convex analysis on Hadamard spaces and scaling problems. Foundation of Computational Mathematics. to appear.
- Interior-point methods on manifolds: theory and applications. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, pages 2021–2030. IEEE, 2023.
- J.-B. Hiriart-Urruty and C. Lemaréchal. Fundamentals of Convex Analysis. Springer-Verlag, Berlin, 2001.
- Block-triangularizations of partitioned matrices under similarity/equivalence transformations. SIAM J. Matrix Anal. Appl., 15(4):1226–1255, 1994.
- Non-commutative Edmonds’ problem and matrix semi-invariants. Comput. Complex., 26(3):717–763, 2017.
- Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex., 27(4):561–593, 2018.
- Convex functions on symmetric spaces, side lengths of polygons and the stability inequalities for weighted configurations at infinity. J. Differential Geom., 81(2):297–354, 2009.
- A. Karlsson and G. A. Margulis. A multiplicative ergodic theorem and nonpositively curved spaces. Comm. Math. Phys., 208(1):107–123, 1999.
- B. Kleiner and B. Leeb. Rigidity of invariant convex sets in symmetric spaces. Invent. Math., 163(3):657–676, 2006.
- Spectral analysis of matrix scaling and operator scaling. SIAM J. Comput., 50(3):1034–1102, 2021.
- U. F. Mayer. Gradient flows on nonpositively curved metric spaces and harmonic maps. Comm. Anal. Geom., 6(2):199–253, 1998.
- K. Murota. Matrices and Matroids for Systems Analysis. Springer-Verlag, Berlin, 2000.
- W. T. Obuchowska. On the minimizing trajectory of convex functions with unbounded level sets. Comput. Optim. Appl., 27(1):37–52, 2004.
- S. Ohta and M. Pálfia. Discrete-time gradient flows and law of large numbers in Alexandrov spaces. Calc. Var. Partial Differential Equations, 54(2):1591–1610, 2015.
- R. T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
- T. Sakai. Riemannian Geometry. American Mathematical Society, Providence, RI, 1996.
- Contractivity of Runge-Kutta methods for convex gradient systems. SIAM J. Numer. Anal., 58(4):2079–2092, 2020.
- R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35:876–879, 1964.
- P. Van Dooren. The computation of Kronecker’s canonical form of a singular pencil. Linear Algebra Appl., 27:103–140, 1979.
- C. T. Woodward. Moment maps and geometric invariant theory. arXiv:0912.1132, 2011.