com.numericalmethod.suanshu.optimization.univariate.bracketsearch

Class Golden.Solution

java.lang.Object

com.numericalmethod.suanshu.optimization.univariate.bracketsearch.BracketSearch.Solution

com.numericalmethod.suanshu.optimization.univariate.bracketsearch.Golden.Solution

All Implemented Interfaces:

MinimizationSolution<java.lang.Double>, UnivariateMinimizer.Solution, java.io.Serializable

Enclosing class:

Golden

public class Golden.Solution
extends BracketSearch.Solution

This is the solution to a Golden section univariate optimization.

See Also:

Serialized Form

Field Summary

Fields inherited from class com.numericalmethod.suanshu.optimization.univariate.bracketsearch.BracketSearch.Solution

f, fmin, fnext, iter, xl, xmin, xnext, xu

Method Summary

Modifier and Type	Method and Description
protected boolean	isMinFound() the convergence criterion
double	search(double lower, double upper) Search for a minimum within the interval [lower, upper].
protected double	xnext() Compute the next best estimate within the bracketing interval.

Methods inherited from class com.numericalmethod.suanshu.optimization.univariate.bracketsearch.BracketSearch.Solution

isBracketing, minimizer, minimum, search, updateStates

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

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()

Description copied from class: BracketSearch.Solution

the convergence criterion

Specified by:

isMinFound in class BracketSearch.Solution

Returns:

true if the current min value is considered to have converged within a threshold

xnext

protected double xnext()

Description copied from class: BracketSearch.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 BracketSearch.Solution

Returns:

the next best guess of the minimizer