ConceptEngineering
Sequential convex programming
Sequential convex programming is a local optimization method for non-convex problems that solves a sequence of convex approximation subproblems.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Stephen Boyd
Connections
5The lectures that define it or assume it, and the concepts next to it.