IE 521

spring 2017

All Classes

Convex Optimization

Course in Catalog
List of Terms offered
Register for Classes

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 415; MATH 444.

Status Icon Legend

My Favorites
My Schedule

: Section Status Closed
: Section Status Open
: Section Status Pending
: Section Status Open (Restricted)
: Section Status Unknown

Section Status updates every 10 minutes.

- IE 199
- IE 300
- IE 310
- IE 311
- IE 330
- IE 340
- IE 361
- IE 397
- IE 398
- IE 413
- IE 420
- IE 431
- IE 497
- IE 498
- IE 511
- IE 521
- IE 525
- IE 526
- IE 527
- IE 531
- IE 590
- IE 597
- IE 598
- IE 599

Detail	Status		CRN	Type	Section	Time	Day	Location	Instructor