Re: optimization

[Etienne Grossmann]

  Hello,

# function for optimization. For example, I have a function, say
#         f(x) = x^2 + 2*x + 5
# and I want to find x0 s.t. f(x0) is maximized. I know I can use binary

  'f' is unbounded! :-). I have a downhill simplex function (Nelder-Mead)
at http://anonimo.isr.ist.utl.pt:8080/~etienne/octave/. It should do for
low-dimensional functions. I also have some code for Levenberg-Marquardt-
like optimization, but it isn't online. Just ask if you would like to see
it.

  Cheers,

  Etienne



-----------------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.

Octave's home on the web:  http://www.che.wisc.edu/octave/octave.html
How to fund new projects:  http://www.che.wisc.edu/octave/funding.html
Subscription information:  http://www.che.wisc.edu/octave/archive.html
-----------------------------------------------------------------------