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 讨论 ↗