-
Notifications
You must be signed in to change notification settings - Fork 1.6k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Mixed-integer differential evolution for next point suggestion #549
base: master
Are you sure you want to change the base?
Conversation
Code linter optimisation with Ruff
@udicaprio I realized the coverage bot is broken, so let me fix that first before moving on with this PR |
@till-m, fine no problem. I just realized that I could make some easy modification that improve the computational performance without affecting the identifications one that I would like to implement. I will be working on this today, it is a quite an easy one but I need to fine-tune some DE parameters. |
Great! Could you tag me or request a review when you're done? |
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #549 +/- ##
==========================================
- Coverage 96.04% 95.99% -0.06%
==========================================
Files 12 12
Lines 1139 1149 +10
==========================================
+ Hits 1094 1103 +9
- Misses 45 46 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Computational-efficiency of the MIP identification increased
Linter improved
Hi,
this commit solves the pull request #548. It implements mixed-integer differential evolution (MIP-DE) to minimise the acquisition function in case of a mixed-integer optimisation.
The MIP-DE is implemented only in case discrete variables are present in the problem.