Sign inSign in
ConceptEngineering

Sequential convex programming

Sequential convex programming is a local optimization method for non-convex problems that solves a sequence of convex approximation subproblems.
as Stephen Boyd defines itStanford University
Watch it explained

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.

Convex optimization2Trust region2Affine approximation1Local optimization1Non-convex optimization1

Lecturers

1
  • Stephen Boyd

    Stanford University · Graduate

    • 1:12:09Advanced Topics and Applications

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.