hw9 - Homework 9 Foundations of Computational Math 1 Fall...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Homework 9 Foundations of Computational Math 1 Fall 2010 There will be no specific program assigned for optimization. As mentioned in class, it is a good idea to implement the basic methods explore their behavior and compare it to the results of the convergence analysis in the notes, homework and textbook. For systems and optimization, Newtons method is recommended for consideration. This can be used with step k = 1 as in the exercise on Newtons method for scalar optimization below or with a simple line search as mentioned in the notes. For unconstrained optimization, the BFGS method is the standard Quasi-Newton method although care must to avoid directions of negative curvature and to select k . However, some simple experiments can give you the flavor of its performance and problems. Important theoretical and practical details on Newton, Quasi-Newton and other methods for unconstrained optimization are discussed in the numerical optimization courses....
View Full Document

This note was uploaded on 07/25/2011 for the course MAD 5403 taught by Professor Gallivan during the Spring '11 term at University of Florida.

Page1 / 2

hw9 - Homework 9 Foundations of Computational Math 1 Fall...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online