QMcBeaver: QMCSteepestDescent.cpp Source File

00001 //            QMcBeaver
00002 //
00003 //         Constructed by 
00004 //
00005 //     Michael Todd Feldmann 
00006 //              and 
00007 //   David Randall "Chip" Kent IV
00008 //
00009 // Copyright 2000-2.  All rights reserved.
00010 //
00011 // drkent@users.sourceforge.net mtfeldmann@users.sourceforge.net
00012 
00013 #include "QMCSteepestDescent.h"
00014 
00015 QMCSteepestDescent::QMCSteepestDescent(QMCObjectiveFunction * function, 
00016          QMCLineSearchStepLengthSelectionAlgorithm * stepAlg,
00017          int maxSteps, double tol):QMCLineSearch(function,stepAlg,maxSteps,tol)
00018 {
00019 }
00020 
00021 void QMCSteepestDescent::calculateHessian()
00022 {
00023   /*
00024     Steepest_Descent is merely the Conjugate Gradient
00025     method where the identity matrix is used as the
00026     inverse Hessian.
00027 
00028     The inverseHessian was initialized
00029     to be the identity matrix.
00030 
00031     Therefore, there's nothing for us to do here.
00032   */
00033 }