Geodesic Convexity: Basic Facts and Definitions

In course

Description

This lecture covers the basics of geodesic convexity, focusing on the properties of geodesically convex functions on Riemannian manifolds. It explains how the pointwise maximum of g-convex functions is also g-convex, and explores the concept of geodesically convex problems. The lecture delves into the relationship between local and global minima, providing insights into the optimization on manifolds. Additionally, it discusses the properties of geodesically convex functions, including strict convexity and strong convexity. The lecture concludes with an examination of different definitions of g-convex sets and their implications for optimization strategies.

In MOOC

Instructor

Official source

https://mediaspace.epfl.ch/media/0_h5mywd1o

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (39)

Covers geodesically convex optimization on Riemannian manifolds, exploring convexity properties and minimization relationships.

Introduces geodesic convexity on Riemannian manifolds and explores its properties.

Explores the dynamics of steady Euler flows on Riemannian manifolds, covering ideal fluids, Euler equations, Eulerisable flows, and obstructions to exhibiting plugs.

Delves into topological entropy in compact manifolds and Reeb flows, emphasizing the forcing of entropy via cylindrical contact homology.

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

Related concepts (35)

Global optimization

Global optimization is a branch of applied mathematics and numerical analysis that attempts to find the global minima or maxima of a function or a set of functions on a given set. It is usually described as a minimization problem because the maximization of the real-valued function is equivalent to the minimization of the function . Given a possibly nonlinear and non-convex continuous function with the global minima and the set of all global minimizers in , the standard minimization problem can be given as that is, finding and a global minimizer in ; where is a (not necessarily convex) compact set defined by inequalities .

Contradiction

In traditional logic, a contradiction occurs when a proposition conflicts either with itself or established fact. It is often used as a tool to detect disingenuous beliefs and bias. Illustrating a general tendency in applied logic, Aristotle's law of noncontradiction states that "It is impossible that the same thing can at the same time both belong and not belong to the same object and in the same respect.

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.

Riemannian manifold

In differential geometry, a Riemannian manifold or Riemannian space (M, g), so called after the German mathematician Bernhard Riemann, is a real, smooth manifold M equipped with a positive-definite inner product gp on the tangent space TpM at each point p. The family gp of inner products is called a Riemannian metric (or Riemannian metric tensor). Riemannian geometry is the study of Riemannian manifolds. A common convention is to take g to be smooth, which means that for any smooth coordinate chart (U, x) on M, the n2 functions are smooth functions.

Proof by contradiction

In logic, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contradiction. Although it is quite freely used in mathematical proofs, not every school of mathematical thought accepts this kind of nonconstructive proof as universally valid. More broadly, proof by contradiction is any form of argument that establishes a statement by arriving at a contradiction, even when the initial assumption is not the negation of the statement to be proved.