# HG changeset patch
# User sis-sou
# Date 1162722714 0
# Node ID 3e922cb85d6a06571a94132a5a8e07ddaa07a27b
# Parent  c50aa39c4a6365807d0556bb1b15e3836227c286
Initial commint into CVS.

diff -r c50aa39c4a63 -r 3e922cb85d6a main/optim/inst/fminsearch.m
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/main/optim/inst/fminsearch.m	Sun Nov 05 10:31:54 2006 +0000
@@ -0,0 +1,32 @@
+## Copyright (C) 2006   Sissou   <sylvain.pelissier@gmail.com>
+##
+## This program is free software; you can redistribute it and/or modify
+## it under the terms of the GNU General Public License as published by
+## the Free Software Foundation; either version 2 of the License, or
+## (at your option) any later version.
+##
+## This program 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 program; if not, write to the Free Software
+## Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+## -*- texinfo -*-
+## @deftypefn {Function File} {[@var{x}] =} fminsearch(@var{f},@var{X0},@var{options},@var{grad},@var{P1},@var{P2}, ...)
+##
+## Find the minimum of a funtion of several variables.
+## By default the method used is the Nelder&Mead Simplex algorithm
+## @seealso{fmin,fmins,nmsmax}
+## @end deftypefn
+
+function [x fval] = fminsearch(funfun, X0, options, grad, varargin)
+	if (nargin == 0); usage('[x fval] = fminsearch(funfun, X0, options, grad, varargin)'); end
+	if (nargin < 3); options=[]; end
+	if (nargin < 4); grad=[]; end
+	if (nargin < 5); varargin=[]; end
+	x = fmins(funfun, X0, options, grad, varargin);
+	fval = feval(funfun,x);
+endfunction;
\ No newline at end of file