Struct QpProblem 

pub struct QpProblem<'a> {
    pub n: usize,
    pub m: usize,
    pub h: &'a SymTMatrix,
    pub g: &'a [Number],
    pub a: &'a GenTMatrix,
    pub bl: &'a [Number],
    pub bu: &'a [Number],
    pub xl: &'a [Number],
    pub xu: &'a [Number],
    pub hessian_inertia: HessianInertia,
}

A convex-or-nonconvex sparse QP:

    min   ½ xᵀ H x + gᵀ x
    s.t.  bl ≤ A x ≤ bu
          xl ≤   x ≤ xu

Two-sided general bounds (equality is bl = bu); two-sided variable bounds (fixed is xl = xu; free is ±NLP_*_BOUND_INF). H is symmetric — only the upper triangle is stored.

The lifetime parameter ties the borrowed problem data to the caller’s storage; the solver never copies any of these fields.

Fields

n: usize

m: usize

h: &'a SymTMatrix

g: &'a [Number]

a: &'a GenTMatrix

bl: &'a [Number]

bu: &'a [Number]

xl: &'a [Number]

xu: &'a [Number]

hessian_inertia: HessianInertia

Implementations

impl<'a> QpProblem<'a>

pub fn validate(&self) -> Result<(), QpError>

Validate every dimension and bound-ordering invariant the solver relies on. Called once at the top of solve before any work happens.