Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038
00039
00040
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 }