pub struct InteriorPointSolver<'a> { /* private fields */ }Expand description
Interior point solver for constrained optimization
Implementations§
Source§impl<'a> InteriorPointSolver<'a>
impl<'a> InteriorPointSolver<'a>
Sourcepub fn new(
n: usize,
m_eq: usize,
m_ineq: usize,
options: &'a InteriorPointOptions,
) -> Self
pub fn new( n: usize, m_eq: usize, m_ineq: usize, options: &'a InteriorPointOptions, ) -> Self
Create new interior point solver
Sourcepub fn solve<F, G>(
&mut self,
fun: &mut F,
grad: &mut G,
eq_con: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array1<f64>>,
eq_jac: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array2<f64>>,
ineq_con: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array1<f64>>,
ineq_jac: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array2<f64>>,
x0: &Array1<f64>,
) -> Result<InteriorPointResult, OptimizeError>
pub fn solve<F, G>( &mut self, fun: &mut F, grad: &mut G, eq_con: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array1<f64>>, eq_jac: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array2<f64>>, ineq_con: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array1<f64>>, ineq_jac: Option<&mut dyn FnMut(&ArrayView1<'_, f64>) -> Array2<f64>>, x0: &Array1<f64>, ) -> Result<InteriorPointResult, OptimizeError>
Solve the constrained optimization problem
Auto Trait Implementations§
impl<'a> Freeze for InteriorPointSolver<'a>
impl<'a> RefUnwindSafe for InteriorPointSolver<'a>
impl<'a> Send for InteriorPointSolver<'a>
impl<'a> Sync for InteriorPointSolver<'a>
impl<'a> Unpin for InteriorPointSolver<'a>
impl<'a> UnwindSafe for InteriorPointSolver<'a>
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> 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.