First-order unconstrained optimization techniques
In this chapter first-order unconstrained optimization approaches have been discussed. These approaches assume the existence of first-order derivatives either through a finite difference approximation or through an adjoint sensitivity approach and also the steepest descent approach and conjugate gradient approaches have been discussed.
Preview this chapter:
First-order unconstrained optimization techniques, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/pc/pbsp008e/PBSP008E_ch6-1.gif /docserver/preview/fulltext/books/pc/pbsp008e/PBSP008E_ch6-2.gif