Count of stored strict-lower L entries, excluding diagonal pivots; fixed at construction even though this property is writable in the type.
Read n+m RHS values in original variable/constraint order and return a fresh mutable solution in that order. Returns undefined before a successful update, on wrong RHS length or nonfinite substitution/refinement. Up to ten correction passes do not guarantee a residual tolerance; RHS is not changed or retained.
Borrow m diagonal values and refactor. Returns false for a nonfinite/zero pivot, invalidating solve; no explicit length or sign gate exists here. A successful update is required before solving. H is not retained or changed.
Mutable LDL-transpose factor owner for [diag(P), A'; A, -diag(H)]. Symbolic ordering and fill remain fixed while update replaces H and rebuilds numeric factors. Equality entries of H are zero; inequality entries are s/z.
Construction assumes admitted conic dimensions and sparse structure. The closure retains the source program, reads its P on updates and copies A into its own sparse matrix, so keep the source unchanged throughout use. Signed pivot stabilization changes factors only; solve refines against the unregularized matrix. Finite refinement is not a convergence certificate.