# [SciPy-user] Can scipy resolve this problem?

zhang chi zhangchipr@gmail....
Wed Jan 7 02:31:49 CST 2009

Thank you ,but I only give a example. In fact there are many points to be
computed, if I calculate very point, it will take me two days to complete
this work.

On Wed, Jan 7, 2009 at 4:24 PM, Matthieu Brucher <matthieu.brucher@gmail.com
> wrote:

> Then perhaps the best course of action is to explicitely test every
> possibility and then take the argmin ?
>
> Matthieu
>
> 2009/1/7 zhang chi <zhangchipr@gmail.com>:
> > Thank you.
> >
> > "step" I mean if x1 $\in$ [2,5], the x1 $\in$ [2,3,4,5]
> >
> > On Wed, Jan 7, 2009 at 4:15 PM, Robert Kern <robert.kern@gmail.com>
> wrote:
> >>
> >> On Wed, Jan 7, 2009 at 02:05, zhang chi <zhangchipr@gmail.com> wrote:
> >> > hi
> >> >     I want to get the minimum value of a derivative free optimization
> >> > problem.  The function F(x1,x2) can't be given the expression, but the
> >> > function can be realized using python language.  Where x1 $\in$
> [1,100],
> >> > and
> >> > x2 $\in$ [50,80]. Can scipy resolve this problem?
> >>
> >> Use fmin_tnc, fmin_l_bfgs_b, or fmin_slsqp for plain bounds like this.
> >>
> >> > I have tried the cobyla,
> >> > but it cannot find the minimum value.
> >> > By the way, the step of x1 and x2 is 1.
> >>
> >> What do you mean by "the step"?
> >>
> >> --
> >> Robert Kern
> >>
> >> "I have come to believe that the whole world is an enigma, a harmless
> >> enigma that is made terrible by our own mad attempt to interpret it as
> >> though it had an underlying truth."
> >>  -- Umberto Eco
> >> _______________________________________________
> >> SciPy-user mailing list
> >> SciPy-user@scipy.org
> >> http://projects.scipy.org/mailman/listinfo/scipy-user
> >
> >
> > _______________________________________________
> > SciPy-user mailing list
> > SciPy-user@scipy.org
> > http://projects.scipy.org/mailman/listinfo/scipy-user
> >
> >
>
>
>
> --
> Information System Engineer, Ph.D.
> Website: http://matthieu-brucher.developpez.com/
> Blogs: http://matt.eifelle.com and http://blog.developpez.com/?blog=92