Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Computing the Newton Step: Matrix-Based Approaches
Graph Chatbot
Related lectures (32)
Previous
Page 2 of 4
Next
Geodesic Convexity: Basic Facts and Definitions
Explores geodesic convexity, focusing on properties of convex functions on manifolds.
Riemannian distance, geodesically convex sets
Covers the structure of Riemannian manifolds, geodesic convexity, and the Riemannian distance function.
Geodesic Convexity: Basic Definitions
Introduces geodesic convexity on Riemannian manifolds and explores its properties.
Optimization on Manifolds: Context and Applications
Introduces optimization on manifolds, covering classical and modern techniques in the field.
Riemannian Hessians: Definition and Example
Covers the definition and computation of Riemannian Hessians on manifolds.
Taylor expansions: second order
Explores Taylor expansions and retractions on Riemannian manifolds, emphasizing second-order approximations and covariant derivatives.
Hands on with Manopt: Optimization on Manifolds
Introduces Manopt, a toolbox for optimization on smooth manifolds with a Riemannian structure, covering cost functions, different types of manifolds, and optimization principles.
Riemannian metrics and gradients: Computing gradients from extensions
Explores computing gradients on Riemannian manifolds through extensions and retractions, emphasizing orthogonal projectors and smooth extensions.
Riemannian connections: What they are and why we care
Covers Riemannian connections, emphasizing their properties and significance in geometry.
Optimization on Manifolds
Covers optimization on manifolds, focusing on smooth manifolds and functions, and the process of gradient descent.