pub struct StrongWolfeCondition<F> { /* private fields */ }
Expand description

§Strong Wolfe conditions

Assures that a step length satisfies a “sufficient decrease” in cost function value (see ArmijoCondition as well as that the absolute value of the slope has been reduced sufficiently (thus making it more likely to be close to a critical point).

Implementations§

source§

impl<F> StrongWolfeCondition<F>
where F: ArgminFloat,

source

pub fn new(c1: F, c2: F) -> Result<Self, Error>

Construct a new instance of StrongWolfeCondition.

§Example
let strongwolfe = StrongWolfeCondition::new(0.0001f64, 0.1f64);

Trait Implementations§

source§

impl<F: Clone> Clone for StrongWolfeCondition<F>

source§

fn clone(&self) -> StrongWolfeCondition<F>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<F: Debug> Debug for StrongWolfeCondition<F>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<F: Default> Default for StrongWolfeCondition<F>

source§

fn default() -> StrongWolfeCondition<F>

Returns the “default value” for a type. Read more
source§

impl<'de, F> Deserialize<'de> for StrongWolfeCondition<F>
where F: Deserialize<'de>,

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<T, G, F> LineSearchCondition<T, G, F> for StrongWolfeCondition<F>
where G: ArgminDot<T, F>, F: ArgminFloat,

source§

fn evaluate_condition( &self, current_cost: F, current_gradient: Option<&G>, initial_cost: F, initial_gradient: &G, search_direction: &T, step_length: F ) -> bool

Evaluate the condition Read more
source§

fn requires_current_gradient(&self) -> bool

Indicates whether this condition requires the computation of the gradient at the new point Read more
source§

impl<F: PartialEq> PartialEq for StrongWolfeCondition<F>

source§

fn eq(&self, other: &StrongWolfeCondition<F>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<F> Serialize for StrongWolfeCondition<F>
where F: Serialize,

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl<F: Copy> Copy for StrongWolfeCondition<F>

source§

impl<F: Eq> Eq for StrongWolfeCondition<F>

source§

impl<F> StructuralPartialEq for StrongWolfeCondition<F>

Auto Trait Implementations§

§

impl<F> RefUnwindSafe for StrongWolfeCondition<F>
where F: RefUnwindSafe,

§

impl<F> Send for StrongWolfeCondition<F>
where F: Send,

§

impl<F> Sync for StrongWolfeCondition<F>
where F: Sync,

§

impl<F> Unpin for StrongWolfeCondition<F>
where F: Unpin,

§

impl<F> UnwindSafe for StrongWolfeCondition<F>
where F: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

source§

impl<T> SendAlias for T

source§

impl<T> SyncAlias for T