1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
<html lang="en">
<head>
<title>Scalar optimization - optim_doc</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="optim_doc">
<meta name="generator" content="makeinfo 4.13">
<link title="Top" rel="start" href="index.html#Top">
<link rel="prev" href="index.html#Top" title="Top">
<link rel="next" href="Residual-optimization.html#Residual-optimization" title="Residual optimization">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<!--
Additional documentation for the optim package for Octave.
Copyright (C) <Olaf Till <i7tiol@t-online.de>>
You can redistribute this documentation and/or modify it under the terms
of the GNU General Public License as published by the Free Software
Foundation; either version 3 of the License, or (at your option) any
later version.
This documentation is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
Public License for more details.
You should have received a copy of the GNU General Public License along
with this documentation; if not, see <http://www.gnu.org/licenses/>.-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<a name="Scalar-optimization"></a>
<p>
Next: <a rel="next" accesskey="n" href="Residual-optimization.html#Residual-optimization">Residual optimization</a>,
Previous: <a rel="previous" accesskey="p" href="index.html#Top">Top</a>,
Up: <a rel="up" accesskey="u" href="index.html#Top">Top</a>
<hr>
</div>
<h2 class="chapter">1 Functions for optimization of a scalar objective function</h2>
<p><a name="index-scalar-optimization-1"></a>
</li></ul>
<p>Frontend
<ul class="menu">
<li><a accesskey="1" href="nonlin_005fmin.html#nonlin_005fmin">nonlin_min</a>: Interface for scalar non-linear
optimization.
</li></ul>
<p>Backends
</p>
<ul class="menu">
<li><a accesskey="2" href="lm_005ffeasible.html#lm_005ffeasible">lm_feasible</a>: L/M-like optimizer, constraints met
throughout optimization.
<li><a accesskey="3" href="octave_005fsqp.html#octave_005fsqp">octave_sqp</a>: A wrapper to core Octaves sqp function.
<li><a accesskey="4" href="siman.html#siman">siman</a>: Simulated annealing with constraints.
<li><a accesskey="5" href="d2_005fmin.html#d2_005fmin">d2_min</a>: Newton-like optimizer, no constraints.
</li></ul>
<p>Alternative frontend
</p>
<ul class="menu">
<li><a accesskey="6" href="fmins.html#fmins">fmins</a>: Frontend for direct search
(gradient-less) algorithms.
</li></ul>
<p>Standalone functions
</p>
<ul class="menu">
<li><a accesskey="7" href="nmsmax.html#nmsmax">nmsmax</a>: A Nelder-Mead simplex algorithm.
<li><a accesskey="8" href="mdsmax.html#mdsmax">mdsmax</a>: A multidirectional search algorithm.
<li><a accesskey="9" href="adsmax.html#adsmax">adsmax</a>: An alternating directions algorithm.
<li><a href="nelder_005fmead_005fmin.html#nelder_005fmead_005fmin">nelder_mead_min</a>: Another Nelder-Mead algorithm.
<li><a href="powell.html#powell">powell</a>: Direction-set (Powell's) method.
<li><a href="standalone-d2_005fmin.html#standalone-d2_005fmin">standalone d2_min</a>: Unconstrained Newton-like minimization,
standalone function.
<li><a href="bfgsmin.html#bfgsmin">bfgsmin</a>: Unconstrained BFGS algorithm.
<li><a href="nrm.html#nrm">nrm</a>: Newton-Raphson algorithm.
<li><a href="cg_005fmin.html#cg_005fmin">cg_min</a>: A conjugate gradient method.
<li><a href="brent_005fline_005fmin.html#brent_005fline_005fmin">brent_line_min</a>: Linesearch, Brent method.
<li><a href="line_005fmin.html#line_005fmin">line_min</a>: Linesearch (minimize a function along dx).
<li><a href="samin.html#samin">samin</a>: A simulated annealing algorithm.
<li><a href="de_005fmin.html#de_005fmin">de_min</a>: A differential evolution algorithm.
<li><a href="battery.html#battery">battery</a>: Repeatedly call bfgsmin.
</ul>
<!-- -->
</body></html>
|
