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.
31520D048Lecture3:30-4:50pmMon, Wed17 of 30Suvrajeet SenKAP148PDF (102403 KB)feesession dates
Information accurate as of March 4, 2018 4:29 pm.