An implementation of a backtracking line search algorithm using cubic interpolation (See Dennis and Schnabel, "Numerical Methods for Unconstrained Optimization and Nonlinear Equations", Prentice-Hall (1983))
![]() | Parameters () Access to the parameter table |
![]() | Search ( HCL_FunctionalGrad_d & fptr, const HCL_Vector_d & xcur, HCL_Vector_d & xnext, HCL_Vector_d & dir, HCL_EvaluateFunctionalGrad_d * xinit_eval) LineSearch algorithm |
![]() | SetScaling ( const HCL_LinearOpAdj_d * S ) SetScaling allows the specification of a different inner product (and hence norm) |
![]() | UnSetScaling () UnSetScaling causes the line search to use the default inner product |
![]() | constructors and destructor
|
![]() | Clean () Write output parameters out to parameter table and deallocate vectors. |
![]() | Initialize ( HCL_VectorSpace_d & dom) Read parameters from parameter table and allocate temporary vectors. |
Term codes
Required output parameters
An implementation of a backtracking line search algorithm using cubic interpolation (See Dennis and Schnabel, "Numerical Methods for Unconstrained Optimization and Nonlinear Equations", Prentice-Hall (1983))
double MinStep
double MaxStep
int MaxSample
double ZeroDivideTol
int DispFlag
int DumpFlag
char DumpFile[81]
int DispPrecision
int DumpPrecision
double BracketIncrease
int MaxTkn
virtual void Clean()
constructors and destructor
virtual Table& Parameters()
virtual void SetScaling( const HCL_LinearOpAdj_d * S )
virtual void UnSetScaling()
virtual HCL_EvaluateFunctionalGrad_d* Search( HCL_FunctionalGrad_d & fptr, const HCL_Vector_d & xcur, HCL_Vector_d & xnext, HCL_Vector_d & dir, HCL_EvaluateFunctionalGrad_d * xinit_eval)
xcur - starting point, on successful completion, this will hold
the computed minimum
dir - starting direction
xinit_eval - evaluation object for starting point
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de