Save To Worklist
COSC 406 101 (Web-Oriented Course)
Formulation and analysis of algorithms for continuous optimization problems; linear, quadratic, semi-definite, nonlinear (constrained and unconstrained), convex (smooth and non-smooth) optimization; large-scale problems; software packages and their implementation; elements of duality theory. Credit will not be granted for both COSC 406 and COSC 506.
|Last day to withdraw without a W standing :||September 21, 2020|
|Last day to withdraw with a W standing |
(course cannot be dropped after this date) :
|November 13, 2020|
|Term||Day||Start Time||End Time||Building||Room||1||Wed||8:00||9:30|
|Total Seats Remaining:||0|
|General Seats Remaining:||0|
|Restricted Seats Remaining*:||0|
- This course will be delivered in a blended synchronous/asynchronous format. The posted lecture time(s) are to be delivered live with remaining content to be delivered offline (asynchronous). Due to this, you may only see one or two lecture times posted for the course as opposed to the normal two or three lectures per week format. This course has HARD pre-requisites. Prerequisite waivers are available online (https://cmps.ok.ubc.ca/undergraduate/student-resources/forms/) ONLY for students who have completed equivalent coursework or have sufficient industry experience. Lab registration is required for this course.
Book Summary :
|Information for the books required for this section is not available.|