|
Math 171B (Introduction to Numerical Optimization: Nonlinear Problems)
Course Topics: Numerical methods for nonlinear optimization Instructor: Prof. Michael Holst (5739 AP&M, mholst@math.ucsd.edu; Normal Office Hours: Mon 2-4pm; Finals: Tue (6/12/12) 1-3pm) Term: Spring 2012 Lecture: 1:00p-1:50p MWF, AP&M B412 TA: Shi (Fox) Cheng (5760 AP&M, scheng@math.ucsd.edu; Office Hours: 4:30p-5:30p Tu-Fri) Discussion: 6:00p-6:50p, B412 AP&M Main Class Webpage: http://ccom.ucsd.edu/~mholst/teaching/ucsd/171b_s12/index.html Textbook(s): P.E. Gill and M.H. Wright, Numerical Optimization, Available at Soft Reserves. Printable Syllabus: Can be found [ here ]. CATALOG DESCRIPTION: 171B. Introduction to Numerical Optimization: Nonlinear Problems (4) Convergence of sequences in Rn, multivariate Taylor series. Bisection and related methods for nonlinear equations in one variable. Newton’s methods for nonlinear equations in one and many variables. Unconstrained optimization and Newton’s method. Equality-constrained optimization, Kuhn-Tucker theorem. Inequality-constrained optimization. Three lectures, one recitation. Knowledge of programming recommended. (Credit not allowed for both Math 171B and Econ 172B.) Prerequisites: Math 171A. COURSE INFORMATION: Problems in all areas of mathematics, science, and engineering can be posed as optimization problems. An optimization problem begins with a set of independent variables or parameters, and often includes a set of side conditions which define acceptable values of the variables for the particular application. These side conditions are known as constraints. The second component of an optimization problem is a measure of goodness called the objective function, which depends in some way on the constrained variables. The solution of an optimization problem is a (possibly non-unique) set of allowed values of the independent variables for which the objective function reaches its "optimal" (maximal or minimal) value. While Math 171A dealt mainly with linear programming, Math 171B deals mainly with nonlinear programming. This involves the minimization of a nonlinear objective function, possibly subject to nonlinear constraints in the form of equalities or inequalities. For historical reasons, this subject area is often called mathematical programming. The modern terminology for this subject is simply optimization, and the numerical algorithms we study form the subject of numerical optimization. GRADES, HOMEWORKS, EXAMS, AND IMPORTANT DATES: Course information, such as homework assignments, due dates, and exam dates, will be maintained on the class webpage. Note that I sometimes make minor changes to the homework assignments as the quarter progresses, based on how much I am able to cover in the lectures. Therefore, CHECK THE WEBPAGE FREQUENTLY. The course will be graded on the homework assignments, two midterm examinations and a final examination, according to the following guidelines:
Here are some other important dates:
There will be five homework assignments throughout the quarter. The first midterm will be based on homeworks 1 and 2. The second midterm will be based on homeworks 3 and 4. The final will be cummulative and based on homeworks 1-4, as well as a small amount of new material from homework 5. The following policies regarding homeworks and exams will be applied:
LECTURES: The lectures will follow the textbook quite closely. Homework assignments will be a combination of theoretical and computer problems; this will require some computer programming using MATLAB. The TA will be able to assist you in accessing your computer accounts as well as MATLAB.
|