Trust Region Methods: Coming up with the Algorithm

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (22)

Page 1 of 3

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Optimisation with Constraints: Interior Point Algorithm

Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.

Simplex Algorithm: Basics

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

RTR practical aspects + tCG

Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.

Trust region methods: Global convergence with minimal effort

Explores trust region methods for global convergence with minimal effort in optimization on manifolds.

Branch & Bound: Optimization

Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.

Trust region methods: framework & algorithms

Covers trust region methods, focusing on the framework and algorithms.

The Trouble with Quadratic Penalties: ALM as a Fix

Explores the challenges of quadratic penalties in optimization and the use of Augmented Lagrangian Methods (ALM) as a solution.

Optimization Techniques: Stochastic Gradient Descent and Beyond

Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.

Nonlinear Optimization Methods

Covers methods for solving nonlinear optimization problems, including direct search, Newton-Raphson, and branch and bound.