IE 521

Fall 2026 All Classes

All Classes

Convex Optimization

Credit: 4 hours.

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.

Prerequisite: ECE 490 or IE 411; MATH 416; MATH 444.

My Favorites

My Schedule

Section Status updates every 10 minutes.

IE 521 class schedule data for fall 2026
	Status		CRN	Type	Section	Time	Day	Location	Instructor	Section Details
			60067	Lecture-Discussion	A	1:00PM -2:20PM	MW	2018 Campus Instructional Facility	Dong, R	Availability: Open Part of Term: 1 Date Range: 08/24/26-12/09/26
			81765	Online	ONL	ARRANGED	n.a.	n.a.	Dong, R	Availability: Open (Restricted) Part of Term: 1 Date Range: 08/24/26-12/09/26 Credit: 4 hours Restriction(s): Restricted to MS: Civil Engr - Online - UIUC, MS:Industrial Engr Online-UIUC, MS:Env Engr CivilEngr ONL-UIUC, NDEG:Engineering GR ONL - UIUC, MS: Aerospace Engr-Online-UIUC, MENG:Mech Engineering Onl-UIUC, MENG:Elec & Comp Eng ONL -UIUC, MENG:Engr:Energy Sys Onl-UIUC, MENG:Bioeng:Gen Bioeng On-UIUC, MENG:Bioeng:Bioinstr Onl -UIUC, MENG:Engr:AeroSys Online- UIUC, MS:Biomed ImageComput ONL-UIUC, MENG:ENGR:Digital Ag ONL- UIUC, or MENG:Engr:ChemEngLead ONL-UIUC.