This is the mail archive of the
gsl-discuss@sourceware.org
mailing list for the GSL project.
Re: nmsimplex iteration.
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: picca <picca at synchrotron-soleil dot Fr>
- Cc: gsl-discuss at sourceware dot org
- Date: Thu, 27 Mar 2008 11:00:51 +0000
- Subject: Re: nmsimplex iteration.
- References: <20080317144641.332eb83a@synchrotron-soleil.Fr>
At Mon, 17 Mar 2008 14:46:41 +0100,
picca wrote:
> To achieve this, we must contraction the simplex till it becomes valid.
> Is it possible to tune the simplex algorithm to solve also those
> locally convex problems.
I don't know but if you find a way I can add a patch for it.
> Another problem is that the initial guest of the simplex is not always
> possible. Can I create by myself the starting points of the simplex ?
The starting points are xi = x0+step_i e_i so it should be possible to
set them all to known values using the step_size vector argument of
gsl_multimin_fsolver_set.
--
Brian Gough