Sign inSign in
ConceptEngineering

Bisection method for quasiconvex optimization

An algorithm to solve quasiconvex optimization problems by repeatedly solving convex feasibility problems at the midpoint of an interval of possible optimal values.
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.

Bisection method1Convex feasibility problem1

Lecturers

1

    Connections

    2

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

    Concept1

    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.