ConceptEngineering
Subgradient
A generalization of the gradient for non-differentiable convex functions satisfying the affine lower bound inequality.
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
1Stephen Boyd
Lectures that assume it
8- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- Convex Optimization II: Primal and Dual Decomposition Methods
- Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Localization and Cutting-Plane Methods
- Convex Optimization II: Primal and Dual Decomposition Methods
- Convex Optimization II: Decomposition Applications
- Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods
Connections
19The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures10
- Subgradients: Subdifferential Calculus & Optimality Conditions
- Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- Convex Optimization II: Primal and Dual Decomposition Methods
- Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- Subgradient Methods for Constrained Problems