Save To Worklist
COSC 406 101 (Lecture)
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 :||January 17, 2020|
|Last day to withdraw with a W standing |
(course cannot be dropped after this date) :
|March 20, 2020|
|Term||Day||Start Time||End Time||Building||Room||2||Mon Wed||8:00||9:30||FIP||139|
|Total Seats Remaining:||8|
|General Seats Remaining:||8|
|Restricted Seats Remaining*:||0|
- This course has HARD pre-requisites. If you are unable to register because of a pre-requisite issue, please email firstname.lastname@example.org. In order to be considered, you must complete a prerequisite waiver form available on the IKBAS website. You must include your name, student number, the course you would like to register in, the pre-requisite(s) you are missing, plus a DETAILED reason why you are requesting the pre-requisite waiver. The form must initially be approved by the course instructor and be accompanied by your full unofficial transcript or SSC grade data prior to Department review. Prerequisite waiver approval does not guarantee registration.
Book Summary :
|No Text Required||Required||NO TEXT REQUIRED||281000028734|