Re: [Dclib-devel] Root-finding algorithm in DLib

[Zhoulai <ze...@gm...>]

Thank you for your reply. Right,  probably Bobyqa is too coarse for my case.

Then, can we use a l-bfgs/bfgs/cg search with long double precision in
dblp?  Can I just take dblp's procedure, change all double to long double
and then it shall work?

BTW,  I don't see why dblp uses to 'double' rather than a type template as
in most BOOST's scientific-computing packages.  Being merely compatible
with 'double' may make dblp unable to meet a high-precision computation
requirement.

Zhoulai

On Wed, Feb 4, 2015 at 5:01 PM, Davis King <dav...@us...>
wrote:

> It's designed for double.  I don't think it will compile if you use any
> other type.
>
> Also, if you have an objective function that is so sensitive that you need
> long double precision then a derivative free optimizer like BOBYQA is
> almost certainly not appropriate for this task.
>
> Cheers,
> Davis
>
>
> ------------------------------------------------------------------------------
> Dive into the World of Parallel Programming. The Go Parallel Website,
> sponsored by Intel and developed in partnership with Slashdot Media, is
> your
> hub for all things parallel software development, from weekly thought
> leadership blogs to news, videos, case studies, tutorials and more. Take a
> look and join the conversation now. http://goparallel.sourceforge.net/
> _______________________________________________
> Dclib-devel mailing list
> Dcl...@li...
> https://lists.sourceforge.net/lists/listinfo/dclib-devel
>
>