Mathematics 467:
Theory and Computational Methods for Optimization (4.0 units)
Methods for static, dynamic, unconstrained, constrained optimization. Gradient, conjugate gradient, penalty methods. Lagrange multipliers, least squares, linear, nonlinear dynamic programming. Application to control and estimation.
- Prerequisite: 1 from (MATH 226 or MATH 227) and 1 from (MATH 225 or MATH 245)
- Note: Register for lecture and discussion
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 39685D | 001 | Lecture | 1:00-1:50pm | MWF | 28 of 35 | Aaron Lauda | KAP148 |   | |
| 39686D | 001 | Discussion | 3:00-3:50pm | Tue, Thu | 28 of 35 | THH110 | |