1*a7e14dcfSSatish Balay #include "tao-private/taolinesearch_impl.h" 2*a7e14dcfSSatish Balay #include "gpcglinesearch.h" 3*a7e14dcfSSatish Balay 4*a7e14dcfSSatish Balay /* ---------------------------------------------------------- */ 5*a7e14dcfSSatish Balay 6*a7e14dcfSSatish Balay #undef __FUNCT__ 7*a7e14dcfSSatish Balay #define __FUNCT__ "TaoLineSearchDestroy_GPCG" 8*a7e14dcfSSatish Balay static PetscErrorCode TaoLineSearchDestroy_GPCG(TaoLineSearch ls) 9*a7e14dcfSSatish Balay { 10*a7e14dcfSSatish Balay PetscErrorCode ierr; 11*a7e14dcfSSatish Balay TAOLINESEARCH_GPCG_CTX *ctx = (TAOLINESEARCH_GPCG_CTX *)ls->data; 12*a7e14dcfSSatish Balay 13*a7e14dcfSSatish Balay PetscFunctionBegin; 14*a7e14dcfSSatish Balay if (ctx->W1) { 15*a7e14dcfSSatish Balay ierr = VecDestroy(&ctx->W1);CHKERRQ(ierr); 16*a7e14dcfSSatish Balay } 17*a7e14dcfSSatish Balay if (ctx->W2) { 18*a7e14dcfSSatish Balay ierr = VecDestroy(&ctx->W2);CHKERRQ(ierr); 19*a7e14dcfSSatish Balay } 20*a7e14dcfSSatish Balay if (ctx->Gold) { 21*a7e14dcfSSatish Balay ierr = VecDestroy(&ctx->Gold);CHKERRQ(ierr); 22*a7e14dcfSSatish Balay } 23*a7e14dcfSSatish Balay if (ctx->x) { 24*a7e14dcfSSatish Balay ierr = PetscObjectDereference((PetscObject)ctx->x); CHKERRQ(ierr); 25*a7e14dcfSSatish Balay } 26*a7e14dcfSSatish Balay 27*a7e14dcfSSatish Balay ierr = PetscFree(ctx);CHKERRQ(ierr); 28*a7e14dcfSSatish Balay ls->data = 0; 29*a7e14dcfSSatish Balay PetscFunctionReturn(0); 30*a7e14dcfSSatish Balay } 31*a7e14dcfSSatish Balay 32*a7e14dcfSSatish Balay 33*a7e14dcfSSatish Balay /*------------------------------------------------------------*/ 34*a7e14dcfSSatish Balay #undef __FUNCT__ 35*a7e14dcfSSatish Balay #define __FUNCT__ "TaoLineSearchView_GPCG" 36*a7e14dcfSSatish Balay static PetscErrorCode TaoLineSearchView_GPCG(TaoLineSearch ls, PetscViewer viewer) 37*a7e14dcfSSatish Balay { 38*a7e14dcfSSatish Balay PetscBool isascii; 39*a7e14dcfSSatish Balay PetscErrorCode ierr; 40*a7e14dcfSSatish Balay PetscFunctionBegin; 41*a7e14dcfSSatish Balay 42*a7e14dcfSSatish Balay ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERASCII,&isascii);CHKERRQ(ierr); 43*a7e14dcfSSatish Balay 44*a7e14dcfSSatish Balay if (isascii) { 45*a7e14dcfSSatish Balay ierr = PetscViewerASCIIPrintf(viewer," GPCG Line search"); CHKERRQ(ierr); 46*a7e14dcfSSatish Balay } else { 47*a7e14dcfSSatish Balay SETERRQ1(((PetscObject)ls)->comm,PETSC_ERR_SUP,"Viewer type %s not supported for GPCG LineSearch",((PetscObject)viewer)->type_name); 48*a7e14dcfSSatish Balay } 49*a7e14dcfSSatish Balay PetscFunctionReturn(0); 50*a7e14dcfSSatish Balay } 51*a7e14dcfSSatish Balay 52*a7e14dcfSSatish Balay /*------------------------------------------------------------*/ 53*a7e14dcfSSatish Balay #undef __FUNCT__ 54*a7e14dcfSSatish Balay #define __FUNCT__ "TaoLineSearchApply_GPCG" 55*a7e14dcfSSatish Balay static PetscErrorCode TaoLineSearchApply_GPCG(TaoLineSearch ls, Vec x, 56*a7e14dcfSSatish Balay PetscReal *f, Vec g, Vec s) 57*a7e14dcfSSatish Balay 58*a7e14dcfSSatish Balay { 59*a7e14dcfSSatish Balay TAOLINESEARCH_GPCG_CTX *neP = (TAOLINESEARCH_GPCG_CTX *)ls->data; 60*a7e14dcfSSatish Balay PetscErrorCode ierr; 61*a7e14dcfSSatish Balay PetscInt i; 62*a7e14dcfSSatish Balay PetscBool g_computed=PETSC_FALSE; /* to prevent extra gradient computation */ 63*a7e14dcfSSatish Balay PetscReal d1,finit,actred,prered,rho, gdx; 64*a7e14dcfSSatish Balay 65*a7e14dcfSSatish Balay PetscFunctionBegin; 66*a7e14dcfSSatish Balay /* ls->stepmin - lower bound for step */ 67*a7e14dcfSSatish Balay /* ls->stepmax - upper bound for step */ 68*a7e14dcfSSatish Balay /* ls->rtol - relative tolerance for an acceptable step */ 69*a7e14dcfSSatish Balay /* ls->ftol - tolerance for sufficient decrease condition */ 70*a7e14dcfSSatish Balay /* ls->gtol - tolerance for curvature condition */ 71*a7e14dcfSSatish Balay /* ls->nfeval - number of function evaluations */ 72*a7e14dcfSSatish Balay /* ls->nfeval - number of function/gradient evaluations */ 73*a7e14dcfSSatish Balay /* ls->max_funcs - maximum number of function evaluations */ 74*a7e14dcfSSatish Balay 75*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_CONTINUE_ITERATING; 76*a7e14dcfSSatish Balay ls->step = ls->initstep; 77*a7e14dcfSSatish Balay if (!neP->W2) { 78*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->W2); CHKERRQ(ierr); 79*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->W1); CHKERRQ(ierr); 80*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->Gold); CHKERRQ(ierr); 81*a7e14dcfSSatish Balay neP->x = x; 82*a7e14dcfSSatish Balay ierr = PetscObjectReference((PetscObject)neP->x); CHKERRQ(ierr); 83*a7e14dcfSSatish Balay } 84*a7e14dcfSSatish Balay 85*a7e14dcfSSatish Balay /* If X has changed, remake work vectors */ 86*a7e14dcfSSatish Balay else if (x != neP->x) { 87*a7e14dcfSSatish Balay ierr = VecDestroy(&neP->x); CHKERRQ(ierr); 88*a7e14dcfSSatish Balay ierr = VecDestroy(&neP->W1); CHKERRQ(ierr); 89*a7e14dcfSSatish Balay ierr = VecDestroy(&neP->W2); CHKERRQ(ierr); 90*a7e14dcfSSatish Balay ierr = VecDestroy(&neP->Gold); CHKERRQ(ierr); 91*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->W1); CHKERRQ(ierr); 92*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->W2); CHKERRQ(ierr); 93*a7e14dcfSSatish Balay ierr = VecDuplicate(x,&neP->Gold); CHKERRQ(ierr); 94*a7e14dcfSSatish Balay ierr = PetscObjectDereference((PetscObject)neP->x); CHKERRQ(ierr); 95*a7e14dcfSSatish Balay neP->x = x; 96*a7e14dcfSSatish Balay ierr = PetscObjectReference((PetscObject)neP->x); CHKERRQ(ierr); 97*a7e14dcfSSatish Balay } 98*a7e14dcfSSatish Balay 99*a7e14dcfSSatish Balay ierr = VecDot(g,s,&gdx); CHKERRQ(ierr); 100*a7e14dcfSSatish Balay if (gdx > 0) { 101*a7e14dcfSSatish Balay ierr = PetscInfo1(ls,"Line search error: search direction is not descent direction. dot(g,s) = %G",gdx); CHKERRQ(ierr); 102*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_FAILED_ASCENT; 103*a7e14dcfSSatish Balay PetscFunctionReturn(0); 104*a7e14dcfSSatish Balay } 105*a7e14dcfSSatish Balay ierr = VecCopy(x,neP->W2); CHKERRQ(ierr); 106*a7e14dcfSSatish Balay ierr = VecCopy(g,neP->Gold); CHKERRQ(ierr); 107*a7e14dcfSSatish Balay if (ls->bounded) { 108*a7e14dcfSSatish Balay /* Compute the smallest steplength that will make one nonbinding variable 109*a7e14dcfSSatish Balay equal the bound */ 110*a7e14dcfSSatish Balay ierr = VecStepBoundInfo(x,ls->lower,ls->upper,s,&rho,&actred,&d1); CHKERRQ(ierr); 111*a7e14dcfSSatish Balay ls->step = PetscMin(ls->step,d1); 112*a7e14dcfSSatish Balay } 113*a7e14dcfSSatish Balay rho=0; actred=0; 114*a7e14dcfSSatish Balay 115*a7e14dcfSSatish Balay if (ls->step < 0) { 116*a7e14dcfSSatish Balay ierr = PetscInfo1(ls,"Line search error: initial step parameter %G < 0\n",ls->step); CHKERRQ(ierr); 117*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_OTHER; 118*a7e14dcfSSatish Balay PetscFunctionReturn(0); 119*a7e14dcfSSatish Balay } 120*a7e14dcfSSatish Balay 121*a7e14dcfSSatish Balay /* Initialization */ 122*a7e14dcfSSatish Balay finit = *f; 123*a7e14dcfSSatish Balay for (i=0; i< ls->max_funcs; i++) { 124*a7e14dcfSSatish Balay 125*a7e14dcfSSatish Balay /* Force the step to be within the bounds */ 126*a7e14dcfSSatish Balay ls->step = PetscMax(ls->step,ls->stepmin); 127*a7e14dcfSSatish Balay ls->step = PetscMin(ls->step,ls->stepmax); 128*a7e14dcfSSatish Balay 129*a7e14dcfSSatish Balay ierr = VecCopy(x,neP->W2); CHKERRQ(ierr); 130*a7e14dcfSSatish Balay ierr = VecAXPY(neP->W2,ls->step,s); CHKERRQ(ierr); 131*a7e14dcfSSatish Balay if (ls->bounded) { 132*a7e14dcfSSatish Balay /* Make sure new vector is numerically within bounds */ 133*a7e14dcfSSatish Balay ierr = VecMedian(neP->W2,ls->lower,ls->upper,neP->W2);CHKERRQ(ierr); 134*a7e14dcfSSatish Balay 135*a7e14dcfSSatish Balay } 136*a7e14dcfSSatish Balay 137*a7e14dcfSSatish Balay /* Gradient is not needed here. Unless there is a separate 138*a7e14dcfSSatish Balay gradient routine, compute it here anyway to prevent recomputing at 139*a7e14dcfSSatish Balay the end of the line search */ 140*a7e14dcfSSatish Balay if (ls->hasobjective) { 141*a7e14dcfSSatish Balay ierr = TaoLineSearchComputeObjective(ls,neP->W2,f); CHKERRQ(ierr); 142*a7e14dcfSSatish Balay g_computed=PETSC_FALSE; 143*a7e14dcfSSatish Balay } else if (ls->usegts){ 144*a7e14dcfSSatish Balay ierr = TaoLineSearchComputeObjectiveAndGTS(ls,neP->W2,f,&gdx); CHKERRQ(ierr); 145*a7e14dcfSSatish Balay g_computed=PETSC_FALSE; 146*a7e14dcfSSatish Balay } else { 147*a7e14dcfSSatish Balay ierr = TaoLineSearchComputeObjectiveAndGradient(ls,neP->W2,f,g); CHKERRQ(ierr); 148*a7e14dcfSSatish Balay g_computed=PETSC_TRUE; 149*a7e14dcfSSatish Balay } 150*a7e14dcfSSatish Balay 151*a7e14dcfSSatish Balay if (0 == i) { 152*a7e14dcfSSatish Balay ls->f_fullstep = *f; 153*a7e14dcfSSatish Balay } 154*a7e14dcfSSatish Balay 155*a7e14dcfSSatish Balay actred = *f - finit; 156*a7e14dcfSSatish Balay ierr = VecCopy(neP->W2,neP->W1); CHKERRQ(ierr); 157*a7e14dcfSSatish Balay ierr = VecAXPY(neP->W1,-1.0,x); CHKERRQ(ierr); /* W1 = W2 - X */ 158*a7e14dcfSSatish Balay ierr = VecDot(neP->W1,neP->Gold,&prered); CHKERRQ(ierr); 159*a7e14dcfSSatish Balay 160*a7e14dcfSSatish Balay if (fabs(prered)<1.0e-100) prered=1.0e-12; 161*a7e14dcfSSatish Balay rho = actred/prered; 162*a7e14dcfSSatish Balay 163*a7e14dcfSSatish Balay /* 164*a7e14dcfSSatish Balay If sufficient progress has been obtained, accept the 165*a7e14dcfSSatish Balay point. Otherwise, backtrack. 166*a7e14dcfSSatish Balay */ 167*a7e14dcfSSatish Balay 168*a7e14dcfSSatish Balay if (actred > 0) { 169*a7e14dcfSSatish Balay ierr = PetscInfo(ls,"Step resulted in ascent, rejecting.\n"); CHKERRQ(ierr); 170*a7e14dcfSSatish Balay ls->step = (ls->step)/2; 171*a7e14dcfSSatish Balay } else if (rho > ls->ftol){ 172*a7e14dcfSSatish Balay break; 173*a7e14dcfSSatish Balay } else{ 174*a7e14dcfSSatish Balay ls->step = (ls->step)/2; 175*a7e14dcfSSatish Balay } 176*a7e14dcfSSatish Balay 177*a7e14dcfSSatish Balay /* Convergence testing */ 178*a7e14dcfSSatish Balay 179*a7e14dcfSSatish Balay if (ls->step <= ls->stepmin || ls->step >= ls->stepmax) { 180*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_OTHER; 181*a7e14dcfSSatish Balay ierr = PetscInfo(ls,"Rounding errors may prevent further progress. May not be a step satisfying\n"); CHKERRQ(ierr); 182*a7e14dcfSSatish Balay ierr = PetscInfo(ls,"sufficient decrease and curvature conditions. Tolerances may be too small.\n"); CHKERRQ(ierr); 183*a7e14dcfSSatish Balay break; 184*a7e14dcfSSatish Balay } 185*a7e14dcfSSatish Balay if (ls->step == ls->stepmax) { 186*a7e14dcfSSatish Balay ierr = PetscInfo1(ls,"Step is at the upper bound, stepmax (%G)\n",ls->stepmax); CHKERRQ(ierr); 187*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_UPPERBOUND; 188*a7e14dcfSSatish Balay break; 189*a7e14dcfSSatish Balay } 190*a7e14dcfSSatish Balay if (ls->step == ls->stepmin) { 191*a7e14dcfSSatish Balay ierr = PetscInfo1(ls,"Step is at the lower bound, stepmin (%G)\n",ls->stepmin); CHKERRQ(ierr); 192*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_LOWERBOUND; 193*a7e14dcfSSatish Balay break; 194*a7e14dcfSSatish Balay } 195*a7e14dcfSSatish Balay if ((ls->nfeval+ls->nfgeval) >= ls->max_funcs) { 196*a7e14dcfSSatish Balay ierr = PetscInfo2(ls,"Number of line search function evals (%D) > maximum (%D)\n",ls->nfeval+ls->nfgeval,ls->max_funcs); CHKERRQ(ierr); 197*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_MAXFCN; 198*a7e14dcfSSatish Balay break; 199*a7e14dcfSSatish Balay } 200*a7e14dcfSSatish Balay if ((neP->bracket) && (ls->stepmax - ls->stepmin <= ls->rtol*ls->stepmax)){ 201*a7e14dcfSSatish Balay ierr = PetscInfo1(ls,"Relative width of interval of uncertainty is at most rtol (%G)\n",ls->rtol); CHKERRQ(ierr); 202*a7e14dcfSSatish Balay ls->reason = TAOLINESEARCH_HALTED_RTOL; 203*a7e14dcfSSatish Balay break; 204*a7e14dcfSSatish Balay } 205*a7e14dcfSSatish Balay } 206*a7e14dcfSSatish Balay ierr = PetscInfo2(ls,"%D function evals in line search, step = %G\n",ls->nfeval+ls->nfgeval,ls->step); CHKERRQ(ierr); 207*a7e14dcfSSatish Balay /* set new solution vector and compute gradient if necessary */ 208*a7e14dcfSSatish Balay ierr = VecCopy(neP->W2, x); CHKERRQ(ierr); 209*a7e14dcfSSatish Balay if (!g_computed) { 210*a7e14dcfSSatish Balay ierr = TaoLineSearchComputeGradient(ls,x,g); CHKERRQ(ierr); 211*a7e14dcfSSatish Balay } 212*a7e14dcfSSatish Balay PetscFunctionReturn(0); 213*a7e14dcfSSatish Balay } 214*a7e14dcfSSatish Balay 215*a7e14dcfSSatish Balay /* ---------------------------------------------------------- */ 216*a7e14dcfSSatish Balay EXTERN_C_BEGIN 217*a7e14dcfSSatish Balay #undef __FUNCT__ 218*a7e14dcfSSatish Balay #define __FUNCT__ "TaoLineSearchCreate_GPCG" 219*a7e14dcfSSatish Balay PetscErrorCode TaoLineSearchCreate_GPCG(TaoLineSearch ls) 220*a7e14dcfSSatish Balay { 221*a7e14dcfSSatish Balay PetscErrorCode ierr; 222*a7e14dcfSSatish Balay TAOLINESEARCH_GPCG_CTX *neP; 223*a7e14dcfSSatish Balay 224*a7e14dcfSSatish Balay PetscFunctionBegin; 225*a7e14dcfSSatish Balay 226*a7e14dcfSSatish Balay 227*a7e14dcfSSatish Balay 228*a7e14dcfSSatish Balay ls->ftol = 0.05; 229*a7e14dcfSSatish Balay ls->rtol = 0.0; 230*a7e14dcfSSatish Balay ls->gtol = 0.0; 231*a7e14dcfSSatish Balay ls->stepmin = 1.0e-20; 232*a7e14dcfSSatish Balay ls->stepmax = 1.0e+20; 233*a7e14dcfSSatish Balay ls->nfeval = 0; 234*a7e14dcfSSatish Balay ls->max_funcs = 30; 235*a7e14dcfSSatish Balay ls->step = 1.0; 236*a7e14dcfSSatish Balay 237*a7e14dcfSSatish Balay ierr = PetscNewLog(ls,TAOLINESEARCH_GPCG_CTX,&neP);CHKERRQ(ierr); 238*a7e14dcfSSatish Balay neP->bracket = 0; 239*a7e14dcfSSatish Balay neP->infoc = 1; 240*a7e14dcfSSatish Balay ls->data = (void*)neP; 241*a7e14dcfSSatish Balay 242*a7e14dcfSSatish Balay ls->ops->setup = 0; 243*a7e14dcfSSatish Balay ls->ops->apply=TaoLineSearchApply_GPCG; 244*a7e14dcfSSatish Balay ls->ops->view =TaoLineSearchView_GPCG; 245*a7e14dcfSSatish Balay ls->ops->destroy=TaoLineSearchDestroy_GPCG; 246*a7e14dcfSSatish Balay ls->ops->setfromoptions=0; 247*a7e14dcfSSatish Balay 248*a7e14dcfSSatish Balay PetscFunctionReturn(0); 249*a7e14dcfSSatish Balay } 250*a7e14dcfSSatish Balay EXTERN_C_END 251