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