pub struct DifferentiableLP {
pub c: Vec<f64>,
pub a_eq: Vec<Vec<f64>>,
pub b_eq: Vec<f64>,
pub g: Vec<Vec<f64>>,
pub h: Vec<f64>,
}Expand description
A differentiable LP layer.
Fields§
§c: Vec<f64>Objective coefficient vector c (n).
a_eq: Vec<Vec<f64>>Equality constraint matrix A (p×n).
b_eq: Vec<f64>Equality constraint rhs b (p).
g: Vec<Vec<f64>>Inequality constraint matrix G (m×n): Gx ≤ h.
h: Vec<f64>Inequality constraint rhs h (m).
Implementations§
Source§impl DifferentiableLP
impl DifferentiableLP
Sourcepub fn new(
c: Vec<f64>,
a_eq: Vec<Vec<f64>>,
b_eq: Vec<f64>,
g: Vec<Vec<f64>>,
h: Vec<f64>,
) -> OptimizeResult<Self>
pub fn new( c: Vec<f64>, a_eq: Vec<Vec<f64>>, b_eq: Vec<f64>, g: Vec<Vec<f64>>, h: Vec<f64>, ) -> OptimizeResult<Self>
Create a new differentiable LP.
Sourcepub fn forward(&self, config: &DiffLPConfig) -> OptimizeResult<DiffLPResult>
pub fn forward(&self, config: &DiffLPConfig) -> OptimizeResult<DiffLPResult>
Solve the LP (forward pass).
Internally converts to a QP with Q = εI (small regularization) and solves via interior-point method.
Sourcepub fn backward(
&self,
result: &DiffLPResult,
dl_dx: &[f64],
config: &DiffLPConfig,
) -> OptimizeResult<ImplicitGradient>
pub fn backward( &self, result: &DiffLPResult, dl_dx: &[f64], config: &DiffLPConfig, ) -> OptimizeResult<ImplicitGradient>
Backward pass: compute gradients of loss w.r.t. LP parameters.
Uses active-set implicit differentiation: at the LP optimum, only active inequality constraints matter, and we differentiate through the resulting equality system.
Trait Implementations§
Source§impl Clone for DifferentiableLP
impl Clone for DifferentiableLP
Source§fn clone(&self) -> DifferentiableLP
fn clone(&self) -> DifferentiableLP
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for DifferentiableLP
impl RefUnwindSafe for DifferentiableLP
impl Send for DifferentiableLP
impl Sync for DifferentiableLP
impl Unpin for DifferentiableLP
impl UnsafeUnpin for DifferentiableLP
impl UnwindSafe for DifferentiableLP
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> 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>
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.