1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/// Box-constrained CMA-ES with adaptive quadratic boundary penalty
/// (Hansen `BoundPenalty`, the default in pycma).
/// Memetic [`BoundedCmaEs`](bounded_cma_es::BoundedCmaEs) with
/// Hansen-2011 injection — sibling of [`cma_inject`] over the bounded
/// outer. Inners: Nelder-Mead, Levenberg-Marquardt, L-BFGS-B.
/// Brent's method (1D root / minimum bracketing).
/// Hansen 2016 (µ/µ_W, λ)-CMA-ES with negative weights.
/// Memetic CMA-ES with Hansen-2011 injection. Inners: Nelder-Mead,
/// Levenberg-Marquardt. For L-BFGS-B inner with consistent bound
/// handling, see [`bounded_cma_inject`].
/// Pure Gauss-Newton solver for nonlinear least squares.
/// Steepest-descent solver with a pluggable line search and optional
/// heavy-ball momentum.
/// L-BFGS family — unconstrained `LBFGS<Unbounded>` (two-loop
/// recursion) and box-constrained `LBFGS<Bounded>` (faithful port of
/// Nocedal's L-BFGS-B v3.0). `LBFGSB` is a type alias for
/// `LBFGS<Bounded>`.
/// Levenberg-Marquardt solver for nonlinear least squares with
/// Nielsen 1999 damping update.
/// MA-LSCh-CMA — memetic algorithm with LS chains (inner: CMA-ES).
/// Nelder-Mead derivative-free simplex solver.
/// Projected gradient descent for box-constrained problems.
/// Elitist (1+λ) random search over a feasible box.
/// Steady-state real-coded GA with BLX-α + NAM + BGA + replace-worst.
/// Levenberg-Marquardt with box bounds (TRF — trust-region-reflective).
/// BFGS quasi-Newton solver (nalgebra-only).
pub use BFGS;
pub use BoundedCmaEs;
pub use BoundedCmaInject;
pub use Brent;
pub use CmaEs;
pub use ;
pub use GaussNewton;
pub use GradientDescent;
pub use LevenbergMarquardt;
pub use ;
pub use ;
pub use ProjectedGradientDescent;
pub use RandomSearch;
pub use Ssga;
pub use Trf;