Loading page · 正在加载页面
Loading page · 正在加载页面
Stanford University · EE364A
凸优化 I
Convex sets, convex functions, duality, and convex optimization algorithms.
Start with one small step
No path choice or account is required. Start one real official item and OpenStudy will remember where you left off.
Subject：Optimization
Level：Advanced
Suggested stage：Years 3–4 (inferred)
Public-material edition：Official course page (year not stated)
Language：English
Videos：Available
Assignments / solutions：Available / Not verified
Not explicitly listed by the official source; no assumption made.
Start here
Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.
Use these to browse a complete resource collection; the section above links directly to individual study items.
Every link points to an official university or course-team page. The year identifies the linked public-material edition, not necessarily the latest on-campus offering; a school may have newer materials that are not public. Unknown facts remain unverified rather than guessed.
Stanford Engineering Everywhere · verified 2026-07-31