Expand description
Optimization and root finding.
Structs§
- Gradient
Descent - The method of gradient descent.
- Newton
Raphson - The Newton-Raphson method.
- Tolerances
- Absolute error tolerances.
Enums§
- Equality
Constraint - Possible equality constraints.
- Line
Search - Available line search algorithms.
- Line
Search Error - Possible errors encountered during line search.
- Optimization
Error - Possible errors encountered during optimization.
- Solve
Strategy - Possible strategies for problems split into global and local variables.
- Trust
Region - How far a step is trusted to follow the model it was built from.
Traits§
- First
Order Optimization - First-order optimization algorithms.
- First
Order Root Finding - First-order root-finding algorithms.
- First
Order Root Finding Block - First-order root-finding algorithms for problems split into global and local variables.
- First
Order Root Finding Incremental - First-order root-finding algorithms that hand out each increment before applying it.
- Second
Order Optimization - Second-order optimization algorithms.
- Second
Order Optimization Block - Second-order optimization algorithms for problems split into global and local variables.
- Second
Order Optimization Incremental - Second-order optimization algorithms that hand out each increment before applying it.
- Zeroth
Order Root Finding - Zeroth-order root-finding algorithms.
Type Aliases§
- Step
Size - The step size taking a decrement of type
Dto an increment ofX.