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 1 of 4
Next
Optimality Conditions: First Order
Covers optimality conditions in optimization on manifolds, focusing on global and local minimum points.
Riemannian connections
Explores Riemannian connections on manifolds, emphasizing smoothness and compatibility with the metric.
Dynamics of Steady Euler Flows: New Results
Explores the dynamics of steady Euler flows on Riemannian manifolds, covering ideal fluids, Euler equations, Eulerisable flows, and obstructions to exhibiting plugs.
RTR practical aspects + tCG
Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.
Riemannian metrics and gradients: Why and definition of Riemannian manifolds
Covers Riemannian metrics, gradients, vector fields, and inner products on manifolds.
Linear convergence with Polyak-Łojasiewicz: Mechanical proof
Explores linear convergence with the Polyak-Łojasiewicz condition on a Riemannian manifold.
Trust Region Methods: Why, with an Example
Introduces trust region methods and presents an example of Max-Cut Burer-Monteiro rank 2 optimization.
Newton's method on Riemannian manifolds
Covers Newton's method on Riemannian manifolds, focusing on second-order optimality conditions and quadratic convergence.
Riemannian Gradient Descent: Convergence Theorem and Line Search Method
Covers the convergence theorem of Riemannian Gradient Descent and the line search method.
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.