PlayaBasicLMBFGS.cpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                 Playa: Programmable Linear Algebra
00005 //                 Copyright 2012 Sandia Corporation
00006 // 
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00008 // the U.S. Government retains certain rights in this software.
00009 //
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu)
00038 // 
00039 
00040 /* @HEADER@ */
00041 
00042 
00043 #include "PlayaBasicLMBFGS.hpp"
00044 #include "PlayaOut.hpp"
00045 #include "PlayaTabs.hpp"
00046 #include "PlayaLinearCombinationImpl.hpp"
00047 #include "PlayaLineSearchBuilder.hpp"
00048 #include "PlayaOptConvergenceTestBuilder.hpp"
00049 
00050 namespace Playa
00051 {
00052 using std::endl;
00053 
00054 BasicLMBFGS::BasicLMBFGS(
00055   const ParameterList& params
00056   )
00057   : LineSearchBasedOptBase(params),
00058     memSize_(getParameter<int>(params, "Max Memory Size"))
00059 {}
00060 
00061 
00062 RCP<DirectionGeneratorBase> 
00063 BasicLMBFGS::makeDirectionGenerator() const 
00064 {
00065   return rcp(new BasicLMBFGSDirection(memSize_));
00066 }
00067 
00068 
00069 BasicLMBFGSDirection::BasicLMBFGSDirection(int memSize)
00070   : memSize_(memSize),
00071     xPrev_(),    
00072     gradPrev_(),
00073     sMem_(),
00074     yMem_()
00075 {}
00076 
00077 bool BasicLMBFGSDirection::generateDirection(
00078   const RCP<ObjectiveBase>& obj,
00079   const Vector<double>& xCur,
00080   const Vector<double>& gradCur,
00081   const double& fCur,
00082   Vector<double>& p)
00083 {
00084   Vector<double> q = gradCur.copy();
00085   int numStored = sMem_.size();
00086   Array<double> alpha(numStored);
00087   Array<double> rho(numStored);
00088 
00089   for (int i=numStored-1; i>=0; i--)
00090   {
00091     rho[i] = 1.0/(sMem_[i]*yMem_[i]);
00092     alpha[i] = rho[i] * (sMem_[i]*q);
00093     q = q - alpha[i]*yMem_[i];
00094   }
00095   
00096   double gamma;
00097   if (numStored > 0)
00098   {
00099     int j = numStored-1;
00100     gamma = (sMem_[j]*yMem_[j])/(yMem_[j]*yMem_[j]);
00101   }
00102   else
00103   {
00104     gamma = obj->getInvHScale();
00105   }
00106 
00107   Vector<double> r = gamma*q;
00108 
00109   for (int i=0; i<numStored; i++)
00110   {
00111     double beta = rho[i]*(yMem_[i]*r);
00112     r = r + (alpha[i]-beta)*sMem_[i];
00113   }
00114 
00115   p = -1.0*r;
00116 
00117   if (xPrev_.ptr().get() != 0)
00118   {
00119     Vector<double> s = xCur - xPrev_;
00120     Vector<double> y = gradCur - gradPrev_;
00121     sMem_.push_back(s);
00122     yMem_.push_back(y);
00123     if ((int) sMem_.size() > memSize_)
00124     {
00125       sMem_.pop_front();
00126       yMem_.pop_front();
00127     }
00128   }
00129   
00130   xPrev_.acceptCopyOf(xCur);
00131   gradPrev_.acceptCopyOf(gradCur);
00132 
00133   return true;
00134 }
00135 
00136 
00137 }

Site Contact