|
Oct 09, 2024
|
|
|
|
MATH 681 - Topics in Optimization Units: 4 Topics in optimization such as integer programming, network algorithms, dynamic programming, game theory, graph theory, quasi-Newton methods for multi-variable unconstrained optimization, constrained optimization with nonlinear constraints, convex optimization, quadratic programming, nonlinear least squares.
Prerequisites: MATH 680. Repeatability: May be repeated for credit for a maximum of 12 units. Possible Instructional Methods: Entirely On-ground. Grading: A-F grading only.
Add to Folder (opens a new window)
|
|