| 1 |
< |
/* |
| 1 |
> |
/* |
| 2 |
|
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
| 3 |
|
* |
| 4 |
|
* The University of Notre Dame grants you ("Licensee") a |
| 42 |
|
#include "minimizers/PRCG.hpp" |
| 43 |
|
namespace oopse { |
| 44 |
|
|
| 45 |
< |
void PRCGMinimizer::init(){ |
| 45 |
> |
void PRCGMinimizer::init(){ |
| 46 |
|
|
| 47 |
< |
calcG(); |
| 47 |
> |
calcG(); |
| 48 |
|
|
| 49 |
< |
for(int i = 0; i < direction.size(); i++){ |
| 50 |
< |
direction[i] = -curG[i]; |
| 49 |
> |
for(int i = 0; i < direction.size(); i++){ |
| 50 |
> |
direction[i] = -curG[i]; |
| 51 |
> |
} |
| 52 |
> |
|
| 53 |
|
} |
| 54 |
|
|
| 55 |
< |
} |
| 56 |
< |
|
| 55 |
< |
int PRCGMinimizer::step(){ |
| 56 |
< |
int lsStatus; |
| 55 |
> |
int PRCGMinimizer::step(){ |
| 56 |
> |
int lsStatus; |
| 57 |
|
|
| 58 |
< |
prevF = curF; |
| 59 |
< |
prevG = curG; |
| 60 |
< |
prevX = curX; |
| 58 |
> |
prevF = curF; |
| 59 |
> |
prevG = curG; |
| 60 |
> |
prevX = curX; |
| 61 |
|
|
| 62 |
< |
//optimize along the search direction and reset minimum point value |
| 62 |
> |
//optimize along the search direction and reset minimum point value |
| 63 |
|
lsStatus = doLineSearch(direction, stepSize); |
| 64 |
|
|
| 65 |
< |
if (lsStatus < 0) |
| 66 |
< |
return -1; |
| 67 |
< |
else |
| 68 |
< |
return 1; |
| 69 |
< |
} |
| 65 |
> |
if (lsStatus < 0) |
| 66 |
> |
return -1; |
| 67 |
> |
else |
| 68 |
> |
return 1; |
| 69 |
> |
} |
| 70 |
|
|
| 71 |
< |
void PRCGMinimizer::prepareStep(){ |
| 72 |
< |
std::vector<double> deltaGrad; |
| 73 |
< |
double beta; |
| 74 |
< |
size_t i; |
| 71 |
> |
void PRCGMinimizer::prepareStep(){ |
| 72 |
> |
std::vector<double> deltaGrad; |
| 73 |
> |
double beta; |
| 74 |
> |
size_t i; |
| 75 |
|
|
| 76 |
< |
deltaGrad.resize(ndim); |
| 76 |
> |
deltaGrad.resize(ndim); |
| 77 |
|
|
| 78 |
< |
//calculate the new direction using Polak-Ribiere Conjugate Gradient |
| 78 |
> |
//calculate the new direction using Polak-Ribiere Conjugate Gradient |
| 79 |
|
|
| 80 |
< |
for(i = 0; i < curG.size(); i++) |
| 81 |
< |
deltaGrad[i] = curG[i] - prevG[i]; |
| 80 |
> |
for(i = 0; i < curG.size(); i++) |
| 81 |
> |
deltaGrad[i] = curG[i] - prevG[i]; |
| 82 |
|
|
| 83 |
|
#ifndef IS_MPI |
| 84 |
< |
beta = dotProduct(deltaGrad, curG) / dotProduct(prevG, prevG); |
| 84 |
> |
beta = dotProduct(deltaGrad, curG) / dotProduct(prevG, prevG); |
| 85 |
|
#else |
| 86 |
< |
double localDP1; |
| 87 |
< |
double localDP2; |
| 88 |
< |
double globalDP1; |
| 89 |
< |
double globalDP2; |
| 86 |
> |
double localDP1; |
| 87 |
> |
double localDP2; |
| 88 |
> |
double globalDP1; |
| 89 |
> |
double globalDP2; |
| 90 |
|
|
| 91 |
< |
localDP1 = dotProduct(deltaGrad, curG); |
| 92 |
< |
localDP2 = dotProduct(prevG, prevG); |
| 91 |
> |
localDP1 = dotProduct(deltaGrad, curG); |
| 92 |
> |
localDP2 = dotProduct(prevG, prevG); |
| 93 |
|
|
| 94 |
< |
MPI_Allreduce(&localDP1, &globalDP1, 1, MPI_DOUBLE,MPI_SUM, MPI_COMM_WORLD); |
| 95 |
< |
MPI_Allreduce(&localDP2, &globalDP2, 1, MPI_DOUBLE,MPI_SUM, MPI_COMM_WORLD); |
| 94 |
> |
MPI_Allreduce(&localDP1, &globalDP1, 1, MPI_DOUBLE,MPI_SUM, MPI_COMM_WORLD); |
| 95 |
> |
MPI_Allreduce(&localDP2, &globalDP2, 1, MPI_DOUBLE,MPI_SUM, MPI_COMM_WORLD); |
| 96 |
|
|
| 97 |
< |
beta = globalDP1 / globalDP2; |
| 97 |
> |
beta = globalDP1 / globalDP2; |
| 98 |
|
#endif |
| 99 |
|
|
| 100 |
< |
for(i = 0; i < direction.size(); i++) |
| 101 |
< |
direction[i] = -curG[i] + beta * direction[i]; |
| 100 |
> |
for(i = 0; i < direction.size(); i++) |
| 101 |
> |
direction[i] = -curG[i] + beta * direction[i]; |
| 102 |
|
|
| 103 |
< |
} |
| 103 |
> |
} |
| 104 |
|
|
| 105 |
|
} |
