Convex Optimization II

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

• Introduction to Digital Integrated Circuits (Spring 2009) By: UC Berkeley
• Electronics for Analog Signal Processing I By: IIT Madras
• Electronics for Analog Signal Processing II By: IIT Madras
• Solid State Devices (IIT Madras) By: IIT Madras
• Embedded Systems By: IIT Delhi
• MEMS and Microsystems By: IIT Kharagpur
• Digital Integrated Circuits (IITMadras) By: IIT Madras
• VLSI Technology By: IIT Madras
• Principles of Digital Communications I By: MIT OCW
• Advanced Digital Integrated Circuits (Spring 2009) By: UC Berkeley

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image