diff options
| author | ziejd2 | 2017-09-28 15:04:40 -0500 |
|---|---|---|
| committer | ziejd2 | 2017-09-28 15:04:40 -0500 |
| commit | 8070dc963753142bb86c4ed698d91fd623ed28e7 (patch) | |
| tree | d0f6dd8fc46a49b819aa55c1a90faa14d8448883 /sourcecodes/bnt-master/nethelp3.3/linemin.htm | |
| parent | 7cc31810d53176e805532b2789955f4eedbce6bb (diff) | |
| download | BNW-8070dc963753142bb86c4ed698d91fd623ed28e7.tar.gz | |
BNW using Octave instead of Matlab.
This version of BNW should perform the same as the original version. The only difference is that it uses Octave instead of Matlab when running BayesNet Toolbox during parameter learning. I am calling this BNW_1.02. It can be accessed at: compbio.uthsc.edu/BNW_1.02
Diffstat (limited to 'sourcecodes/bnt-master/nethelp3.3/linemin.htm')
| -rw-r--r-- | sourcecodes/bnt-master/nethelp3.3/linemin.htm | 74 |
1 files changed, 74 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/nethelp3.3/linemin.htm b/sourcecodes/bnt-master/nethelp3.3/linemin.htm new file mode 100644 index 00000000..e4d7a8b9 --- /dev/null +++ b/sourcecodes/bnt-master/nethelp3.3/linemin.htm @@ -0,0 +1,74 @@ +<html> +<head> +<title> +Netlab Reference Manual linemin +</title> +</head> +<body> +<H1> linemin +</H1> +<h2> +Purpose +</h2> +One dimensional minimization. + +<p><h2> +Description +</h2> +<CODE>[x, options] = linemin(f, pt, dir, fpt, options)</CODE> uses Brent's +algorithm to find the minimum of the function <CODE>f(x)</CODE> along the +line <CODE>dir</CODE> through the point <CODE>pt</CODE>. The function value at the +starting point is <CODE>fpt</CODE>. The point at which <CODE>f</CODE> has a local minimum +is returned as <CODE>x</CODE>. The function value at that point is returned +in <CODE>options(8)</CODE>. + +<p><CODE>linemin(f, pt, dir, fpt, options, p1, p2, ...)</CODE> allows +additional arguments to be passed to <CODE>f()</CODE>. + +<p>The optional parameters have the following interpretations. + +<p><CODE>options(1)</CODE> is set to 1 to display error values. + +<p><CODE>options(2)</CODE> is a measure of the absolute precision required for the value +of <CODE>x</CODE> at the solution. + +<p><CODE>options(3)</CODE> is a measure of the precision required of the objective +function at the solution. Both this and the previous condition must be +satisfied for termination. + +<p><CODE>options(14)</CODE> is the maximum number of iterations; default 100. + +<p><h2> +Examples +</h2> +An example of the use of this function to find the minimum of a function +<CODE>f</CODE> in the direction <CODE>sd</CODE> can be found in <CODE>conjgrad</CODE> +<PRE> + +x = linemin(f, xold, sd, fold, lineoptions); +</PRE> + + +<p><h2> +Algorithm +</h2> + +Brent's algorithm uses a mixture of quadratic interpolation and golden +section search to find the minimum of a function of a single variable once +it has been bracketed (which is done with <CODE>minbrack</CODE>). This is adapted +to minimize a function along a line. +This implementation +is based on that in Numerical Recipes. + +<p><h2> +See Also +</h2> +<CODE><a href="conjgrad.htm">conjgrad</a></CODE>, <CODE><a href="minbrack.htm">minbrack</a></CODE>, <CODE><a href="quasinew.htm">quasinew</a></CODE><hr> +<b>Pages:</b> +<a href="index.htm">Index</a> +<hr> +<p>Copyright (c) Ian T Nabney (1996-9) + + +</body> +</html> \ No newline at end of file |