An implementation of a backtracking line search algorithm using cubic and quadratic interpolation (See Fletcher, "Practical Methods of Optimization" (2nd edition), Wiley, (1987))
HCL_LineSearch_Fl_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 and quadratic interpolation (See Fletcher, "Practical Methods of Optimization" (2nd edition), Wiley, (1987)). The description of this class follows closely that of the base class HCL_LineSearch_d, which should be consulted for details.
xcur - starting point, on successful completion, this will hold
the computed minimum
dir - starting direction
xinit_eval - evaluation object for starting point (or NULL)
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