public class LinearSearchBrent
extends java.lang.Object
Brent's method is a complicated but popular root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. In detail in: Brent (1973). Algorithms for Minimization without Derivatives. Prentice-Hall, Englewood Cliffs, NJ.
Constructor and Description |
---|
LinearSearchBrent(FUN vf,
double[][][] vdbus,
double[][][] vxbus)
Constructor for linear search based on Brent's method.
|
Modifier and Type | Method and Description |
---|---|
double |
g(double alpha)
Returns the error of the weights dSearch.
|
double |
minimumSearch(Randomize r)
Minimize function g().
|
public LinearSearchBrent(FUN vf, double[][][] vdbus, double[][][] vxbus)
Constructor for linear search based on Brent's method.
vf
- evaluation function.vdbus
- search direction matrix.vxbus
- start point matrix.public double g(double alpha)
Returns the error of the weights dSearch.
alpha
- the factor of modification of dSearchpublic double minimumSearch(Randomize r)
Minimize function g(). Function g() is the error of the neural network.
r
- random numbers generator