pub struct PenaltyMethod {
pub options: PenaltyOptions,
}Expand description
Penalty method solver
Fields§
§options: PenaltyOptionsImplementations§
Source§impl PenaltyMethod
impl PenaltyMethod
Sourcepub fn with_options(options: PenaltyOptions) -> Self
pub fn with_options(options: PenaltyOptions) -> Self
Create with custom options
Sourcepub fn solve_slice<F, E, G>(
&self,
f: F,
eq_cons: &[E],
ineq_cons: &[G],
x0: &[f64],
) -> OptimizeResult<PenaltyResult>
pub fn solve_slice<F, E, G>( &self, f: F, eq_cons: &[E], ineq_cons: &[G], x0: &[f64], ) -> OptimizeResult<PenaltyResult>
Solve with equality and inequality constraints.
§Arguments
f: Objective function taking a&[f64]eq_cons: Equality constraint functions h_j(x) = 0 (slices)ineq_cons: Inequality constraint functions g_i(x) <= 0 (slices)x0: Initial point
Sourcepub fn solve<F, E, G>(
&self,
f: F,
eq_cons: &[E],
ineq_cons: &[G],
x0: &Array1<f64>,
) -> OptimizeResult<PenaltyResult>where
F: Fn(&ArrayView1<'_, f64>) -> f64,
E: Fn(&ArrayView1<'_, f64>) -> f64,
G: Fn(&ArrayView1<'_, f64>) -> f64,
pub fn solve<F, E, G>(
&self,
f: F,
eq_cons: &[E],
ineq_cons: &[G],
x0: &Array1<f64>,
) -> OptimizeResult<PenaltyResult>where
F: Fn(&ArrayView1<'_, f64>) -> f64,
E: Fn(&ArrayView1<'_, f64>) -> f64,
G: Fn(&ArrayView1<'_, f64>) -> f64,
Solve with ArrayView1 interface (for compatibility)
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PenaltyMethod
impl RefUnwindSafe for PenaltyMethod
impl Send for PenaltyMethod
impl Sync for PenaltyMethod
impl Unpin for PenaltyMethod
impl UnsafeUnpin for PenaltyMethod
impl UnwindSafe for PenaltyMethod
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
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
Converts
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>
Converts
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<T> Pointable for T
impl<T> Pointable for T
Source§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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
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
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.