Skip to Main Content

MATH5018

Download as PDF

Convex Optimization for Nonlinear Programing

MathematicsNo College Designated

Course Title

Convex Optimiz Nonlinear Prgmg

Department

Credit Hrs

3

Grade Modes

Audit, Pass/Fail, Standard Letter

Course Description

Theory and applications of constrained and unconstrained optimization, convexity, Lagrangian duality theory, Newton and quasi-Newton methods, first order methods.
Prerequisite
Complete ANY of the following Courses:
  • MATH4010
  • MATH4015

Or consent of instructor and advisor.