Lecture

Geodesically Convex Optimization

Description

This lecture introduces the concept of geodesically convex optimization on a Riemannian manifold, defining geodesic convexity and providing examples. It covers the properties of geodesically convex sets, functions, and linear functions, as well as the conditions for a function to be geodesically convex or concave. The lecture also explores the relationship between convexity and minimization, presenting proofs and claims related to global and local minimizers. Additionally, it discusses the convexity of functions on geodesic segments and the implications of strong convexity. The study of Riemannian manifolds and continuous functions in the context of convex optimization is highlighted.

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.