Lecture 1 | Convex Optimization I (Stanford)
Stanford · 2 則 HN 推薦
影片問答
可以請 AI 解釋目前片段，或總結整部影片。如果回答附有時間戳記，點選即可跳到對應片段。
試著問：這裡講的是什麼意思？
需使用 Google 登入。確認前可查看最多會扣除多少點數。
The introductory lecture of Stephen Boyd's Stanford Convex Optimization I course (EE 364A). It outlines convex sets, functions and problems, and the course's coverage of least-squares, linear and semidefinite programming, duality and interior-point methods.
HN 推薦的原因： HN recommends Boyd's lectures as a fantastic, often funny follow-up to linear algebra and as a step in machine learning study paths.
“These lectures are fantastic after you've mastered the basics of linear algebra” 閱讀 HN 討論 ↗