MATH661.01
Download as PDF
Convex Optimization
Subject
MATH - Mathematics
Description
An introduction to modern convex optimization, including basics of convex analysis and duality, linear conic programming, robust optimization, and applications.
Prerequisite(s): Admission to a graduate program in Mathematics and Statistics or consent of the Department.
Prerequisite(s): Admission to a graduate program in Mathematics and Statistics or consent of the Department.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -B, GFC Hours (3-0)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Units
3
Repeat for Credit
No
Subject code
MATH