[RBFOpt] Running example in RBFOpt

[Chuong Thaidoan]

Dear Giacomo,
I am wondering whether your algorithm can run for a lookup function. This
lookup function is a discrete function that takes values in a given data
and returns discrete values. If this is the case, please let me know some
advice on how to handle points that are not in the database.
Thank you.
Best regards,
TD Chuong

On Thu, Sep 24, 2020 at 11:45 PM Giacomo Nannicini <giacomo.n at gmail.com>
wrote:

> There's no way to do that with RBFOpt. I also don't know of any
> algorithm for black-box problems that does that type of computation.
> In principle, after running the optimization, say, via an object "alg"
> of class RbfoptAlgorithm, you can loop through alg.all_node_pos and
> alg.all_node_val to see all points explored by the algorithm.The first
> data structure contains the x coordinates, the second data structure
> contains the corresponding objective function value.
>
> G
>
> On Thu, Sep 24, 2020 at 9:20 AM Chuong Thaidoan
> <chuongthaidoan at gmail.com> wrote:
> >
> > Dear Giacomo,
> > Thank you for your reply. Solutions that I mean are best solutions.
> Since some problem may have several best solutions, and  so I want to know
> how to print out all such best solutions, not just one.
> > Best regards,
> > TD Chuong
> >
> >
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/rbfopt/attachments/20200925/aa4d0c46/attachment.html>