Expand description
BiteOpt — Rust port of Aleksey Vaneev’s BiteOpt
(https://github.com/avaneev/biteopt), from the C++ biteopt.h/biteaux.h.
The implementation includes the LCG-hash BiteRnd, 58-bit integer-mantissa
parameters, adaptive sparse selectors, dynamic and diverging populations,
all primary generators, CSpherOpt, sequential Nelder-Mead, deep
multi-population solution exchange, and delayed-feedback batch ask/tell.
Parity is validated by convergence because no independent Python twin
exists.
Structs§
- BiteOpt
- Bite
Params - Tunable inputs for
optimize_bite. - Bite
Result - Outcome of a BiteOpt run.
- BiteRnd
- Deep
Bite Opt MBiteOpt instances with solution “pushing” between them.M == 1is a plain single-population BiteOpt.
Functions§
- optimize_
bite - Run BiteOpt on a bounded problem.
mis the “deep” depth (number of populations);m <= 1is a plain single-population run. - validate_
bite_ inputs - Validate the dimensions and numeric domain required by BiteOpt.