Sign inSign in
ConceptEngineering

Lower bound in ACCPM

Obtaining a lower bound on the optimal value by solving the dual of the piecewise linear relaxed problem constructed during analytic center cutting plane method iterations.
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.

Analytic center cutting plane method1Duality1Piecewise linear approximation1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.