Semidefinite Programming: Formulations and Applications

Related lectures (31)

Page 2 of 4

Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Introduces induced flows, basis matrices, and tree solutions in graph theory.

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.

Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.

Demonstrates the iterative process of applying Dijkstra's algorithm to find optimal paths.

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.