1. Home
  2. Material Detail: EE364B Convex Optimization II

Material Detail

EE364B Convex Optimization II

EE364B Convex Optimization II

Continuation of Convex Optimization I. 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.
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Online Course
Date Added to MERLOT:
October 20, 2011
Date Modified in MERLOT:
June 12, 2018
Author:
Submitter:
Sorel Reisman
Primary Audience:
College General Ed, College Lower Division
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
Unknown
Creative Commons:
No

Browse...

Disciplines with similar materials as EE364B Convex Optimization II
People who viewed this also viewed
Other materials like EE364B Convex Optimization II

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.