pub struct ReplacementAlgorithm {
pub options: BilevelSolverOptions,
pub upper_step: f64,
}Expand description
Replacement algorithm for bilevel optimization.
Constructs the optimal reaction mapping y*(x) by solving the lower-level problem for each candidate x, then optimizes the upper-level objective restricted to the graph {(x, y*(x))}.
Fields§
§options: BilevelSolverOptionsAlgorithm options
upper_step: f64Step size for upper-level gradient
Implementations§
Source§impl ReplacementAlgorithm
impl ReplacementAlgorithm
Sourcepub fn new(options: BilevelSolverOptions, upper_step: f64) -> Self
pub fn new(options: BilevelSolverOptions, upper_step: f64) -> Self
Create a replacement algorithm solver with given options
Sourcepub fn solve<F, G>(
&self,
problem: BilevelProblem<F, G>,
) -> OptimizeResult<BilevelResult>
pub fn solve<F, G>( &self, problem: BilevelProblem<F, G>, ) -> OptimizeResult<BilevelResult>
Solve the bilevel problem by replacing lower level with optimal reaction
Trait Implementations§
Auto Trait Implementations§
impl Freeze for ReplacementAlgorithm
impl RefUnwindSafe for ReplacementAlgorithm
impl Send for ReplacementAlgorithm
impl Sync for ReplacementAlgorithm
impl Unpin for ReplacementAlgorithm
impl UnsafeUnpin for ReplacementAlgorithm
impl UnwindSafe for ReplacementAlgorithm
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.