EE 5239: Introduction to Nonlinear Optimization

3 CreditsOnline Available

Nonlinear optimization. Analytical/computational methods. Constrained optimization methods. Convex analysis, Lagrangian relaxation, non-differentiable optimization, applications in integer programming. Optimality conditions, Lagrange multiplier theory, duality theory. Control, communications, management science applications. prereq: [3025, Math 2373, Math 2374, CSE grad student] or dept consent

View on University Catalog

All Instructors

A- Average (3.633)Most Common: A (39%)

This total also includes data from semesters with unknown instructors.

213 students
SWFDCBA
  • 4.42

    /5

    Recommend
  • 3.93

    /5

    Effort
  • 4.49

    /5

    Understanding
  • 4.35

    /5

    Interesting
  • 4.47

    /5

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2023 provided by the Office of Institutional Data and Research

      Privacy Policy