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: GD as a Matrix-Free Way
Graph Chatbot
Related lectures (31)
Previous
Page 3 of 4
Next
Manopt: Optimization Toolbox for Manifolds
Introduces Manopt, a toolbox for optimization on manifolds, focusing on solving optimization problems on smooth manifolds using the Matlab version.
Topology of Riemann Surfaces
Covers the topology of Riemann surfaces, focusing on orientation and orientability.
General Manifolds and Topology
Covers manifolds, topology, smooth maps, and tangent vectors in detail.
Retractions vector fields and tangent bundles: Tangent bundles
Covers retractions, tangent bundles, and embedded submanifolds on manifolds with proofs and examples.
Newton's method: Optimization on manifolds
Explores Newton's method for optimizing functions on manifolds using second-order information and discusses its drawbacks and fixes.
Riemannian connections
Explores Riemannian connections on manifolds, emphasizing smoothness and compatibility with the metric.
Geodesics in Wasserstein Space
Explores geodesics in the Wasserstein space, emphasizing constant speed geodesics and their properties.
Trust Region Methods: Why, with an Example
Introduces trust region methods and presents an example of Max-Cut Burer-Monteiro rank 2 optimization.
Algebraic Topology and Differential Geometry
Explores algebraic topology and differential geometry in understanding robot dynamics and global behavior.
Gradient Descent
Covers the concept of gradient descent in scalar cases, focusing on finding the minimum of a function by iteratively moving in the direction of the negative gradient.