Trust Region Methods: Why, with an Example

Related lectures (28)

Covers optimization on manifolds, focusing on smooth manifolds and functions, and the process of gradient descent.

Covers non-convex optimization techniques and their applications in machine learning.

Covers the convergence theorem of Riemannian Gradient Descent and the line search method.

Covers Newton's method on Riemannian manifolds, focusing on second-order optimality conditions and quadratic convergence.

Explores Riemannian connections on manifolds, emphasizing smoothness and compatibility with the metric.

Covers Newton's Method for optimization and discusses the caveats of indefiniteness in optimization problems.

Introduces Manopt, a toolbox for optimization on manifolds, focusing on solving optimization problems on smooth manifolds using the Matlab version.

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

Page 2 of 2