Related papers: How does the contraction property fail for convex …

Non-convex optimization problems are ubiquitous in machine learning, especially in Deep Learning. While such complex problems can often be successfully optimized in practice by using stochastic gradient descent (SGD), theoretical analysis…

Equipped with the L^2-distortion distance, the space "X" of all metric measure spaces (X,d,m) is proven to have nonnegative curvature in the sense of Alexandrov. Geodesics and tangent spaces are characterized in detail. Moreover, classes of…

We prove local Poincar\'e inequalities under various curvature-dimension conditions which are stable under the measured Gromov-Hausdorff convergence. The first class of spaces we consider is that of weak CD(K,N) spaces as defined by Lott…

This paper focuses on the quadratic optimization over two classes of nonnegative zero-norm constraints: nonnegative zero-norm sphere constraint and zero-norm simplex constraint, which have important applications in nonnegative sparse…

We show that the sectional curvature of a Riemannian manifold is nonnegative if, and only if, the entropy functional is matrix displacement convex. As an application we obtain intrinsic dimensional evolution variational inequalities, and…

In discrete convex analysis, the scaling and proximity properties for the class of L$^\natural$-convex functions were established more than a decade ago and have been used to design efficient minimization algorithms. For the larger class of…

The Euclidean space notion of convex sets (and functions) generalizes to Riemannian manifolds in a natural sense and is called geodesic convexity. Extensively studied computational problems such as convex optimization and sampling in convex…

We introduce notions of concavity for functions on balanced polyhedral spaces, and we show that concave functions on such spaces satisfy several strong continuity properties.

We further research on the accelerated optimization phenomenon on Riemannian manifolds by introducing accelerated global first-order methods for the optimization of $L$-smooth and geodesically convex (g-convex) or $\mu$-strongly g-convex…

We prove minimax theorems for lower semicontinuous functions defined on a Hilbert space. The main tool is the theory of $\Phi$-convex functions and sufficient and necessary conditions for the minimax equality to hold for $\Phi$-convex…

We construct an example of a smooth convex function on the plane with a strict minimum at zero, which is real analytic except at zero, for which Thom's gradient conjecture fails both at zero and infinity. More precisely, the gradient orbits…

Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…

We are interested in existence of gradient flows for shape functionals especially for first Laplacian eigenvalues. We introduce different techniques to prove existence and use different formulations for gradient flows. We apply a…

Space curve motion describes dynamics of material defects or interfaces, can be found in image processing or vortex dynamics. This article analyses some properties of space curves evolved by the curve shortening flow. In contrast to the…

In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…

Michor and Mumford showed that the mean curvature flow is a gradient flow on a Riemannian structure with a degenerate geodesic distance. It is also known to destroy the uniform density of gridpoints on the evolving surfaces. We introduce a…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker…

To solve convex optimization problems with a noisy gradient input, we analyze the global behavior of subgradient-like flows under stochastic errors. The objective function is composite, being equal to the sum of two convex functions, one…

We prove that the static convexity is preserved along two kinds of locally constrained curvature flows in hyperbolic space. Using the static convexity of the flow hypersurfaces, we prove new family of geometric inequalities for such…