Optimization in Networks

Related lectures (31)

Page 2 of 4

Covers semi-definite programming and optimization over positive semidefinite cones.

Explores the Legendre transform, duality in convex analysis, and optimization problems.

Covers the proof of strong duality in optimization problems and provides examples of Rayleigh quotient optimization.

Explores self-dual cones in convex optimization and their applications in various optimization problems.

Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.

Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.

Explores duality in linear programming, strong duality, complementary slackness, and the economic interpretation of dual variables as prices.

Explores primal-dual optimization, minimax problems, and gradient descent-ascent methods for optimization algorithms.

Delves into duality in optimization, weak duality, cost certificates, and transforming non-linear programs into linear ones.

Covers linear programming duality and complementary slackness condition.