Computer Science 521:
Optimization: Theory and Algorithms (3.0 units)
Conditions for optimality; nonlinear programming algorithms for constrained and unconstrained problems. Special problems such as quadratic, separable, fractional, geometric programming.
- Prerequisite: 1 from (MATH 225 or EE 441)
- Crosslist: This course is offered by the ISE department but may qualify for major credit in CSCI. To register, enroll in ISE 520.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 31520D | 048 | Lecture | 3:30-4:50pm | Mon, Wed | 17 of 30 | Suvrajeet Sen | KAP148 | PDF (102403 KB) |   |