qp(H, f, A, b[, Aeq, beq], lb, ub) — the convex quadratic program min ½ zᵀHz + fᵀz subject to A z ≤ b, Aeq z = beq, lb ≤ z ≤ ub (F_0053).
An absent group is 0 (Decision A, the kkt precedent): qp(H, f, 0, 0, lb, ub) has no inequalities. An absent bound is -inf / inf, and a number for lb or ub applies to every variable, so lb = 0 reads as "all non-negative". Evaluates to the n×1 minimiser and stays symbolic whenever qpSolve declines; the REPL appends why, or, on success, which constraints are active (Decision C). The warm start is library API only.
Value parameters
a
the inequality matrix, or 0
b
its right-hand side, or 0
eq
the equality matrix and right-hand side, when given