Class FibonaccMinimizer.Solution

    • Method Detail

      • search

        public double search​(double lower,
                             double initial,
                             double upper)
        Description copied from interface: UnivariateMinimizer.Solution
        Search for a minimum within the interval [lower, upper].
        Specified by:
        search in interface UnivariateMinimizer.Solution
        Overrides:
        search in class BracketSearchMinimizer.Solution
        Parameters:
        lower - the lower bound for the bracketing interval which contains a minimum
        initial - an initial guess
        upper - the upper bound for the bracketing interval which contains a minimum
        Returns:
        an approximate minimizer
      • search

        public double search​(double lower,
                             double upper)
        Description copied from interface: UnivariateMinimizer.Solution
        Search for a minimum within the interval [lower, upper].
        Parameters:
        lower - the lower bound for the bracketing interval which contains a minimum
        upper - the upper bound for the bracketing interval which contains a minimum
        Returns:
        an approximate minimizer
      • isMinFound

        protected boolean isMinFound()
        This algorithm stops only after a pre-specified number of iterations. This is to guarantee the search interval is reduced to certain size, or a fraction of the input interval.
        Specified by:
        isMinFound in class BracketSearchMinimizer.Solution
        Returns:
        false
      • xnext

        protected double xnext()
        Description copied from class: BracketSearchMinimizer.Solution
        Compute the next best estimate within the bracketing interval. A particular univariate minimization algorithm implements the logic in this method.
        Specified by:
        xnext in class BracketSearchMinimizer.Solution
        Returns:
        the next best guess of the minimizer