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))
HCL_LineSearch_DS_d ( char *fname = NULL ) Usual constructor | |
virtual Table& | Parameters () const Access to the parameter table |
virtual void | SetScaling ( const HCL_LinearOp_d * S ) SetScaling allows the specification of a different inner product (and hence norm) |
virtual void | UnSetScaling () UnSetScaling causes the line search to use the default inner product |
virtual HCL_EvaluateFunctional_d* | Search ( HCL_Functional_d & fptr, const HCL_Vector_d & xcur, HCL_Vector_d & xnext, HCL_Vector_d & dir, HCL_EvaluateFunctional_d * xinit_eval) LineSearch algorithm |
virtual ostream& | Write ( ostream & str ) const Prints description of the object |
Term codes
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)).The description of this class differs from the description of the base class HCL_LineSearch_d in only one regard: the second criteria for defining an acceptable step is This prevents short steps by requiring that the slope be increased from its initial (negative) value, although it does not require that the step reach an approximate minimizer. This criterion is sufficient to allow a positive definite update in a BFGS algorithm.
xcur - starting point, on successful completion, this will hold
the computed minimum
dir - starting direction
xinit_eval - evaluation object for starting point
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de