pub struct OptimizeOpts {Show 13 fields
pub algorithm: Option<Algorithm>,
pub seed: Option<u32>,
pub chain: Option<u32>,
pub init_alpha: Option<f64>,
pub tol_obj: Option<f64>,
pub tol_rel_obj: Option<f64>,
pub tol_grad: Option<f64>,
pub tol_rel_grad: Option<f64>,
pub tol_param: Option<f64>,
pub history_size: Option<u32>,
pub iter: Option<u32>,
pub jacobian: Option<bool>,
pub refresh: Option<u32>,
}Expand description
Arguments for optimization.
Fields§
§algorithm: Option<Algorithm>Algorithm to use.
seed: Option<u32>The random seed to use for the optimization.
chain: Option<u32>The chain id to advance the PRNG.
init_alpha: Option<f64>Line search step size for first iteration.
tol_obj: Option<f64>Convergence tolerance on changes in objective function value.
tol_rel_obj: Option<f64>Convergence tolerance on relative changes in objective function value.
tol_grad: Option<f64>Convergence tolerance on the norm of the gradient.
tol_rel_grad: Option<f64>Convergence tolerance on the relative norm of the gradient.
tol_param: Option<f64>Convergence tolerance on changes in parameter value.
history_size: Option<u32>Size of the history for LBFGS Hessian approximation. The value should be less than the dimensionality of the parameter space. 5-10 usually sufficient.
iter: Option<u32>Total number of iterations.
jacobian: Option<bool>When true, use the Jacobian matrix to approximate the Hessian.
Default is false.
refresh: Option<u32>How frequently to emit convergence statistics, in number of iterations.
Trait Implementations§
Source§impl Clone for OptimizeOpts
impl Clone for OptimizeOpts
Source§fn clone(&self) -> OptimizeOpts
fn clone(&self) -> OptimizeOpts
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for OptimizeOpts
impl Debug for OptimizeOpts
Source§impl Default for OptimizeOpts
impl Default for OptimizeOpts
Source§fn default() -> OptimizeOpts
fn default() -> OptimizeOpts
Auto Trait Implementations§
impl Freeze for OptimizeOpts
impl RefUnwindSafe for OptimizeOpts
impl Send for OptimizeOpts
impl Sync for OptimizeOpts
impl Unpin for OptimizeOpts
impl UnsafeUnpin for OptimizeOpts
impl UnwindSafe for OptimizeOpts
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.