Sign inSign in
ConceptEngineering

Subgradient method

A simple iterative algorithm to minimize a nondifferentiable convex function by stepping in the direction of any subgradient scaled by a step size.
as Stephen Boyd defines itStanford UniversityThe wording closest to all 4 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Stephen Boyd

    Stanford University · Graduate

    • 4:04Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
    • 1:10:36Convex Optimization II: Localization and Cutting-Plane Methods
    • 31:05Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods

Lectures that assume it

4

Connections

17

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

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.