Implement BOBYQA (Bound Optimization BY Quadratic Approximations)

[SimonBlanke]

Implement the BOBYQA algorithm, a derivative-free optimization method for problems with bound constraints. It extends NEWUOA by accommodating box constraints on the variables, while still employing a quadratic approximation strategy within a trust region.

For information about the mathematical background see #73.

[Soham-47]

Hii @SimonBlanke , can I work on this implementation?

[SimonBlanke]

Sure, you can look into this explanation in the core-optimizer to understand how to structure a new optimization class:
https://github.com/SimonBlanke/Gradient-Free-Optimizers/blob/main/src/gradient_free_optimizers/optimizers/core_optimizer/core_optimizer.py#L32