UI Wordmark

IE 521 A1 - Convex Optimization

Campus: Urbana-Champaign

Description:

Finite dimensional convex optimization problems; characterization of optimal solutions; iterative algorithms for differentiable and nondifferentiable problems; distributed optimization algorithms; robust problems and solutions; applications of convex optimization models. Course Information: Prerequisite: ECE 490 or IE 411; MATH 415; MATH 444.

Academic Program Restrictions:

MCS:Computer Sci Online -UIUC

Option 1

Number of Required Visit(s): 0

Course Level: Graduate

Credit: 4

Term(s): Summer


Home

Bachelor's Degree

Master's Degree

Doctoral Degree

Certificates

Continuing Education

Search Programs

Search Courses

FAQ

Contact Us


University of Illinois Online
Phone: (866) 633-8465 - Join Us  Facebook
© Copyright 2015 - University of Illinois

Cookie Settings