42 #ifndef DIRECT_LINE_SEARCH_STRATEGY_H
43 #define DIRECT_LINE_SEARCH_STRATEGY_H
48 #include "ConstrainedOptPack_Types.hpp"
50 namespace ConstrainedOptPack {
126 ,std::ostream *out = 0
140 #endif // DIRECT_LINE_SEARCH_STRATEGY_H
Abstracts a 1D merit function {abstract}.
virtual bool do_line_search(const MeritFuncCalc1D &phi, value_type phi_k, value_type *alpha_k, value_type *phi_kp1, std::ostream *out=0)=0
Called to perform the linesearch.
virtual ~DirectLineSearch_Strategy()
virtual int max_iter() const =0
Get the maximum number of iterations.
virtual int num_iterations() const =0
Get the number of iterations performed.
Thrown if the direction vector d_k is not a descent direction for the merit funciton.
virtual void set_max_iter(int max_iter)=0
Set the maximum number of iterations.
Abstract strategy interface for 1D line searches {abstract}.
virtual void print_algorithm(std::ostream &out, const std::string &leading_str) const
Print the direct line search algorithm.