Lecture
Descent methods and line search: Finiteness of the line search algorithm
Related lectures (45)
PCA: Derivation and Optimization
Covers the derivation of PCA projection, error minimization, and eigenvector optimization.
Simplex Algorithm
Covers the Simplex algorithm for function minimization with linear constraints.
Monte Carlo Chain: Motivation and Algorithm
Explores the motivation and algorithm behind the Monte Carlo Chain method.
Primal-dual Optimization: Algorithms and Convergence
Explores primal-dual optimization algorithms for convex-concave minimax problems, discussing convergence properties and applications.
Ford-Fulkerson: a worked example
Demonstrates the Ford-Fulkerson algorithm through a step-by-step worked example.
Convergence Criteria
Discusses convergence criteria and when iteration stops, focusing on known cases and metrics attention.
Mixing Tank: Process Control
Covers the process control of a mixing tank and optimizing its performance.
Shortest Path: Properties of the AlgorithmMOOC: Optimization: principles and algorithms - Linear optimization
Explains the properties of the shortest path algorithm and how to find the shortest path in a network.
Photo Maquette
Explores the importance of photo maquette in the creative process.
Descent methods and line search: Inexact line searchMOOC: Optimization: principles and algorithms - Linear optimization
Explores descent methods, line search, and the importance of small steps.