arXiv · 2409.14434
The sparseness of g-convex functions
Abstract
The g-convexity of functions on manifolds is a generalization of the convexity of functions on Rn. It plays an essential role in both differential geometry and non-convex optimization theory. This paper is concerned with g-convex smooth functions on manifolds. We establish criteria for the existence of a Riemannian metric (or connection) with respect to which a given function is g-convex. Using these criteria, we obtain three sparseness results for g-convex functions: (1) The set of g-convex functions on a compact manifold is nowhere dense in the space of smooth functions. (2) Most polynomials on Rn that is g-convex with respect to some geodesically complete connection has at most one critical point. (3) The density of g-convex univariate (resp. quadratic, monomial, additively separable) polynomials asymptotically decreases to zero
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yu Wang, Ke Ye. 2024-09-22. The sparseness of g-convex functions. https://arxiv.org/abs/2409.14434
Cite the original work for its findings. Save a collection to share your selection of sources.