More Electrical Engineering Courses
Convex Optimization II
Course Description
Continuation of 364a. Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in implementation. Convex relaxations of hard problems, and global optimization via branch & bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications. Course requirements include a substantial project.
Tags: Math, Math Calculus

Prof. Boyd in lecture 7: "Ellipsoid Methods".
1 rating
No
Video Lectures & Study Materials
Comments
There are no comments.
Be the first to post one.
Posting Comment...
Disclaimer:
CosmoLearning is promoting these materials solely for nonprofit educational purposes, and to recognize contributions made by Stanford University (Stanford) to online education. We do not host or upload any copyrighted materials, including videos hosted on video websites like YouTube*, unless with explicit permission from the author(s).
All intellectual property rights are reserved to Stanford and involved parties.
CosmoLearning is not endorsed by Stanford, and we are not affiliated
with them, unless otherwise specified. Any questions, claims or concerns
regarding this content should be directed to their creator(s).
*If any embedded videos constitute copyright infringement, we strictly recommend contacting the website hosts directly to have such videos taken down. In such an event, these videos will no longer be playable on CosmoLearning or other websites.
*If any embedded videos constitute copyright infringement, we strictly recommend contacting the website hosts directly to have such videos taken down. In such an event, these videos will no longer be playable on CosmoLearning or other websites.