Convexifying Nonconvex Problems: SDP and SOCP Relaxations

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 2 of 4

Semi-Definite Programming

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

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Linear Optimization: Auxiliary Problem

Explores the formulation of the auxiliary problem in linear optimization and its role in optimal decision-making.

Duality in Linear Programming

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

Linear Programming Techniques in Reinforcement Learning

Covers the linear programming approach to reinforcement learning, focusing on its applications and advantages in solving Markov decision processes.

Optimisation Problem: Solving by FM

Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.

Convex Relaxation: Negative Type Theorems

Explores convex relaxation and negative type theorems in convex programs.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.

Optimization Problems: Standard Form

Explores optimization problems in standard form, convex optimization, and optimality criteria.

Integer Programs: Optimization and Constraints

Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.