Lecture
Optimal Transport: Forward-Backward Splitting
Related lectures (32)
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
PCA: Derivation and Optimization
Covers the derivation of PCA projection, error minimization, and eigenvector optimization.
Thermodynamic Properties: Equations and Models
Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.
Probabilistic Models for Linear Regression
Covers the probabilistic model for linear regression and its applications in nuclear magnetic resonance and X-ray imaging.
Optimization Principles
Covers optimization principles, including linear optimization, networks, and concrete research examples in transportation.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Projection Matrices: Min-Cut and Gradient Descent
Explores projection matrices in the context of min-cut and gradient descent algorithms, emphasizing their role in optimization.
Monte Carlo Chain: Motivation and Algorithm
Explores the motivation and algorithm behind the Monte Carlo Chain method.
Optimal Control: KKT Conditions
Explores optimal control and KKT conditions for non-linear optimization with constraints.
Projected Gradient Descent
Explores convex constrained optimization through Projected Gradient Descent, focusing on tangent space and iterative minimization.