about summary refs log tree commit diff
path: root/sourcecodes/bnt-master/nethelp3.3/minbrack.htm
diff options
context:
space:
mode:
authorziejd22017-09-28 15:04:40 -0500
committerziejd22017-09-28 15:04:40 -0500
commit8070dc963753142bb86c4ed698d91fd623ed28e7 (patch)
treed0f6dd8fc46a49b819aa55c1a90faa14d8448883 /sourcecodes/bnt-master/nethelp3.3/minbrack.htm
parent7cc31810d53176e805532b2789955f4eedbce6bb (diff)
downloadBNW-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/minbrack.htm')
-rw-r--r--sourcecodes/bnt-master/nethelp3.3/minbrack.htm65
1 files changed, 65 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/nethelp3.3/minbrack.htm b/sourcecodes/bnt-master/nethelp3.3/minbrack.htm
new file mode 100644
index 00000000..f49d18f5
--- /dev/null
+++ b/sourcecodes/bnt-master/nethelp3.3/minbrack.htm
@@ -0,0 +1,65 @@
+<html>
+<head>
+<title>
+Netlab Reference Manual minbrack
+</title>
+</head>
+<body>
+<H1> minbrack
+</H1>
+<h2>
+Purpose
+</h2>
+Bracket a minimum of a function of one variable.
+
+<p><h2>
+Description
+</h2>
+<CODE>brmin, brmid, brmax, numevals] = minbrack(f, a, b, fa)</CODE>
+finds a bracket of three points around a local minimum of
+<CODE>f</CODE>.  The function <CODE>f</CODE> must have a one dimensional domain.
+<CODE>a < b</CODE> is an initial guess at the minimum and maximum points
+of a bracket, but <CODE>minbrack</CODE> will search outside this interval if
+necessary. The bracket consists of three points (in increasing order)
+such that <CODE>f(brmid) < f(brmin)</CODE> and <CODE>f(brmid) < f(brmax)</CODE>.
+<CODE>fa</CODE> is the value of the function at <CODE>a</CODE>: it is included to
+avoid unnecessary function evaluations in the optimization routines.
+The return value <CODE>numevals</CODE> is the number of function evaluations
+in <CODE>minbrack</CODE>.
+
+<p><CODE>minbrack(f, a, b, fa, p1, p2, ...)</CODE> allows additional
+arguments to be passed to <CODE>f</CODE>
+
+<p><h2>
+Examples
+</h2>
+An example of the use of this function to bracket the minimum of a function
+<CODE>f</CODE> in the direction <CODE>sd</CODE> can be found in <CODE>linemin</CODE>
+<PRE>
+
+[min, mid, max, nevals]] = minbrack('linef', 0.0, 1.0, fa, f, pt, dir);
+</PRE>
+
+where the function <CODE>linef</CODE> is used to turn a general function <CODE>f</CODE>
+into a one dimensional one.
+
+<p><h2>
+Algorithm
+</h2>
+
+Quadratic extrapolation with a limit to the maximum step size is
+used to find the outside points of the bracket.  This implementation
+is based on that in Numerical Recipes.
+
+<p><h2>
+See Also
+</h2>
+<CODE><a href="linemin.htm">linemin</a></CODE>, <CODE><a href="linef.htm">linef</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