This course provides an introductory treatment of topics in
Nonlinear Programming. This includes a
hands-on approach with exposure to existing software packages.
The Mathematics of Nonlinear Programming, by
Peressini, A.L., Sullivan, F.E.,
Uhl, J.J..
( Please send me any
typos that you find! )
Home Page, C&O 367,
http://orion.math.uwaterloo.ca/~hwolkowi/henry/teaching/w01/367.w01/readme.html
Term Work:
will consist of homework problems
and a midterm (in class) exam.
(See attached schedule of assignments.)
Assignments are due at the start of class on the due date.
Late assignments will not be accepted.
Midterm Exam:
80 minutes, Tuesday, Feb. 27, in class.
Final Exam:
A 3-hour exam, scheduled by the instructor.
(Please see the detailed course outline for topics covered during the
semester.)
Reading: Text Chapter 1. (finish the chapter, 1.3,1.4,1.5)
References (FYI):
Eigenvalue Show, this is the ftp directory for matlab files. At the
bottow there is access to a file called - eigshow.m.
This file provides an eigenvalue show that is both entertaining and
informative.
Introduction to Convex Optimization, course notes
by Stephen Boyd, including
Lagrangian duality, LP duality, interior-point methods, and semidefinite
programming.
Convex Sets and Functions continued...
HOMEWORK:
Homework #3 due: Feb. 1 (at start of class)
Pg 77-80, Problems: 1. b); 2. d); 11.; 15.
(Note: x,y,z positive is needed in 15 e)
Reading: Text Chapter 2. (finish chapter, 2.3,2.4,2.5)
Iterative Methods for Unconstrained Optimization
HOMEWORK:
Homework #4 due: Feb. 8, 2001. (at start of class)