
Lecture 1 | Convex Optimization I (Stanford)
Stanford
Choose the Stanford course opening for the scope of convex optimization. It is a course entry point rather than a standalone recipe for all decision problems.
Choose optimization, control or mathematical history
This small mathematics collection crosses subjects rather than forming a missing chapter of one course. The clearest technical choices are an introduction to convex optimization and an overview of feedback control.
Boyd’s course begins a sustained treatment of optimization problems. Brunton’s control overview introduces a different task: changing a system’s behavior through feedback. Choose optimization when your question is which feasible choice best meets an objective; choose control when the system evolves and observations inform later actions. Both routes benefit from linear algebra, and the original courses offer the continuity a miscellaneous collection cannot.

Stanford
Choose the Stanford course opening for the scope of convex optimization. It is a course entry point rather than a standalone recipe for all decision problems.

Steve Brunton
Choose the Control Bootcamp overview for the role of feedback. Follow the original sequence if the basic language is new.
An opening lecture establishes a course’s scope, not mastery of its methods. Check the original prerequisites and exercises before advancing.
By HackerTube Run. Updated . We compared source-video titles, available uploader descriptions and the linked archive records. The choice of starting points and viewing questions is our editorial guidance. These notes do not claim full-video viewing or independent expert review.
The complete list below preserves the October 31, 2026 snapshot and its original score order. Its labels and summaries include AI-generated source material; topic membership is broader than our selected starting points. Availability and factual claims can change. Suggest a correction.
Browse the full snapshot after choosing your starting point.