Overview
Syllabus
Intro
Polynomial Programming
A General Recipe for Relaxations of PP
Sum-of-square Relaxations for PP
Overcoming the size blow-up
Sparse Relaxations of PP Polynomial Optimization Problem
SOCP-based Hierarchy for PP
Motivation
Proposed Solution Methods
Application - AC Optimal Power Flow
Challenges - AC Optimal Power Flow
ACOPF: Parameters
ACOPF: Formulation
ACOPF: Quadratic PP
Optimal Power Flow - Duality
Sparsity of the SDP relaxation: 39 Buses
OPF - Results
Uncertainty in Power Systems
ACOPF as a non-convex quadratic optimization problem
Adjustable Robust ACOPF
Affine equalities
Algorithm to solve (ARP)
Details of piecewise-affine approximations
Numerical experiments: instances with 30 to 118 buses
Conclusions
Taught by
Fields Institute