Focus course
The course page you are viewing.
Courses | MATH347
MATH347: Introduction to Continuous Optimization
Published course information, generated as a static page and SVG graph.
Course Graph
Prerequisite flow into the course, and dependencies flow out from it.
Co-requisites are treated as prerequisite links, and equivalent or cross-listed courses are merged into shared course nodes. The simplified view shows one prerequisite level above the course and one dependency level downstream.
Graph key and legend Expand for department colours, choice nodes, and merged-course labels used in the course map. MATH3471 of Merged
Mathematics
Connected course
A prerequisite or downstream course included in the current view.
Choice point
A shared requirement such as choose 1 of, 2 of, or 3 of.
Grouping junction
A small circular join keeps shared requirement branches tidy.
Merged course node
Equivalent or cross-listed courses are collapsed into one shared node.
Find
Search highlights matching branches.
Overlays
View
Additional course requirements
- Minimum third-year standing
- additional prerequisites set by department depending upon topic
Mathematics
Subject area
300-level
Course level
2
Programs that name this course
6
Published prerequisite links
Official Source
Calendar entry
Description
Catalog description
Introduction to theory and algorithms of optimization in the continuous context. Topics may include: optimality conditions for unconstrained and constrained optimization problems, solutions to least squares problems, iterative methods for unconstrained optimization such as gradient descent and Newton’s method, convex sets and convex functions, convex duality, introduction to software tools.
Supplemental Notes
Catalog notes
- Credit will be granted for only one of MATH 347, MATH 447, MATH 491A (if taken in the same topic), MATH 492 (if taken in the same topic).
Program Use