Home »Electronics »Stanford » Convex Optimization II




Convex Optimization II

Lecture 14: L1 methods

Embed
Download:    | Torrent 902 views

SEE: Guide to Download Stanford Video Lecture

Course Description :

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 and bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications.

Other Resources :

Syllabus | Handouts | Citation |


Other Electronics Courses

» check out the complete list of Electronics lectures          

 

Electronics Lecture Notes

 

Comments

Post your Comments