pub struct ADMMOptimizer<F: Float> {
pub rho: F,
pub eps_pri: F,
pub eps_dual: F,
pub max_iter: usize,
}Expand description
ADMM (Alternating Direction Method of Multipliers) optimizer for general constrained problems
Fields§
§rho: FPenalty parameter
eps_pri: FPrimary tolerance
eps_dual: FDual tolerance
max_iter: usizeMaximum number of iterations
Implementations§
Source§impl<F: Float + ScalarOperand> ADMMOptimizer<F>
impl<F: Float + ScalarOperand> ADMMOptimizer<F>
Sourcepub fn solve_lasso<LossGrad, Data>(
&self,
loss_grad: LossGrad,
lambda: F,
x0: &Array1<F>,
data: &Data,
) -> Result<OptimizeResult<F>, OptimizeError>
pub fn solve_lasso<LossGrad, Data>( &self, loss_grad: LossGrad, lambda: F, x0: &Array1<F>, data: &Data, ) -> Result<OptimizeResult<F>, OptimizeError>
Solve Lasso using ADMM
Trait Implementations§
Source§impl<F: Clone + Float> Clone for ADMMOptimizer<F>
impl<F: Clone + Float> Clone for ADMMOptimizer<F>
Source§fn clone(&self) -> ADMMOptimizer<F>
fn clone(&self) -> ADMMOptimizer<F>
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<F> Freeze for ADMMOptimizer<F>where
F: Freeze,
impl<F> RefUnwindSafe for ADMMOptimizer<F>where
F: RefUnwindSafe,
impl<F> Send for ADMMOptimizer<F>where
F: Send,
impl<F> Sync for ADMMOptimizer<F>where
F: Sync,
impl<F> Unpin for ADMMOptimizer<F>where
F: Unpin,
impl<F> UnwindSafe for ADMMOptimizer<F>where
F: UnwindSafe,
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.