Struct LinearInequalityConstraints 

pub struct LinearInequalityConstraints {
    pub a: Array2<f64>,
    pub b: Array1<f64>,
}

Fields

a: Array2<f64>

b: Array1<f64>

Implementations

impl LinearInequalityConstraints

pub fn new(a: Array2<f64>, b: Array1<f64>) -> Result<Self, String>

Construct with the equal-row-count invariant enforced. The dimensions a.nrows() == b.len() are required by every downstream KKT / active-set routine; routing every construction site through this constructor eliminates a class of “rows out of sync” bugs at the type boundary.

pub fn from_per_coordinate_lower_bounds( lower_bounds: &Array1<f64>, ) -> Option<Self>

Build the per-coordinate β_i >= lower_bounds[i] inequality system. Non-finite entries are treated as “no bound” and skipped; returns None when every entry is non-finite so callers can short-circuit the no-constraint case without allocating the empty A/b pair.

Trait Implementations

impl Clone for LinearInequalityConstraints

fn clone(&self) -> LinearInequalityConstraints

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LinearInequalityConstraints

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.