Implementing of a dominated space partition strategy

[TsingQAQ]

This PR implements a dominated space partition strategy from lacour2017box.
The motivation of having dominated partition strategy is:

• As a fix of Current divided and conquer method working slow  #293 (a non-dominated partition method built on this PR will come in following PR, a preview can be found at here). It can be used for a non-dominated partition strategy, which behaves much faster than the current DividedAndConquerNonDominated, this can made MOO in Trieste much faster for obj>2.
• It can be used for dominate space partition based acquisition functions as well. (e.g., PFES)

[uri-granta]

I can't follow all of the math, but the code is all nicely structured and well commented!

[uri-granta]

Stupid question: how will this actually be used in a real optimization problem? Our multi-objective code currently all calls prepare_default_non_dominated_partition_bounds.

[TsingQAQ]

sorry should explain more clearly, it is the first step towards modifying prepare_default_non_dominated_partition_bounds,

In an upcoming PR (which implement an additional functionality (i.e., FlipTrickPartitionNonDominated) on top of HypervolumeBoxDecompositionIncrementalDominated), we will replace the current used DividedAndConquerNonDominated by FlipTrickPartitionNonDominated, which is expected to provide a faster non-dominated space partition for num of objectives >=3 (hence faster running of code).

These two PRs are separate in the hope to minimize a chunk of code that needs to be reviewed at once, if it is easier to review as a whole to clear the usage of the new code, we may also directly start from the upcoming PR.