Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Geodesic Convexity: Basic Definitions

In course

MATH-512: Optimization on manifolds

We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemannian geometry (with a focus dictated by computational con ...

Description

This lecture introduces the concept of geodesic convexity on Riemannian manifolds, defining convex sets and geodesically convex sets. It explores the properties of geodesically convex functions and their relation to convexity.

Instructor

Nicolas Boumal

Official source

Ontological neighbourhood

Mathematics

Geometry: Differential geometry

Related concepts (32)

Geodesic

In geometry, a geodesic (ˌdʒiː.əˈdɛsɪk,-oʊ-,-ˈdiːsɪk,_-zɪk) is a curve representing in some sense the shortest path (arc) between two points in a surface, or more generally in a Riemannian manifold. The term also has meaning in any differentiable manifold with a connection. It is a generalization of the notion of a "straight line". The noun geodesic and the adjective geodetic come from geodesy, the science of measuring the size and shape of Earth, though many of the underlying principles can be applied to any ellipsoidal geometry.

Intrinsic metric

In the mathematical study of metric spaces, one can consider the arclength of paths in the space. If two points are at a given distance from each other, it is natural to expect that one should be able to get from the first point to the second along a path whose arclength is equal to (or very close to) that distance. The distance between two points of a metric space relative to the intrinsic metric is defined as the infimum of the lengths of all paths from the first point to the second.

Pseudo-Riemannian manifold

In differential geometry, a pseudo-Riemannian manifold, also called a semi-Riemannian manifold, is a differentiable manifold with a metric tensor that is everywhere nondegenerate. This is a generalization of a Riemannian manifold in which the requirement of positive-definiteness is relaxed. Every tangent space of a pseudo-Riemannian manifold is a pseudo-Euclidean vector space. A special case used in general relativity is a four-dimensional Lorentzian manifold for modeling spacetime, where tangent vectors can be classified as timelike, null, and spacelike.

Curvature of Riemannian manifolds

In mathematics, specifically differential geometry, the infinitesimal geometry of Riemannian manifolds with dimension greater than 2 is too complicated to be described by a single number at a given point. Riemann introduced an abstract and rigorous way to define curvature for these manifolds, now known as the Riemann curvature tensor. Similar notions have found applications everywhere in differential geometry of surfaces and other objects. The curvature of a pseudo-Riemannian manifold can be expressed in the same way with only slight modifications.

Riemannian geometry

Riemannian geometry is the branch of differential geometry that studies Riemannian manifolds, defined as smooth manifolds with a Riemannian metric (an inner product on the tangent space at each point that varies smoothly from point to point). This gives, in particular, local notions of angle, length of curves, surface area and volume. From those, some other global quantities can be derived by integrating local contributions.

Related lectures (48)

Geodesic Convexity: Basic Facts and Definitions

Explores geodesic convexity, focusing on properties of convex functions on manifolds.

Differential Forms on Manifolds

Introduces differential forms on manifolds, covering tangent bundles and intersection pairings.

Optimization on Manifolds: Context and Applications MOOC: Introduction to optimization on smooth manifolds: first order methods

Introduces optimization on manifolds, covering classical and modern techniques in the field.

Convexity and Jacobians

Explores convexity, Jacobians, subdifferentials, and convergence rates in optimization and function analysis.

Optimization Basics: Norms, Convexity, Differentiability