Whether the refinement's full-row admission adopted the candidate.
Original row numbers of the working equations at each working solve.
Candidate multipliers in original row order, signed so a positive value presses on the upper endpoint and a negative one on the lower endpoint.
Dual sweeps started; zero for "interval-joint".
Multipliers changed in each dual sweep.
Steps started, dual sweeps or working solves; at most the budget.
Full-row KKT merit of each working candidate measured, in order.
Largest of the stationarity residual and the working-equation residual after each working step that produced multipliers.
Full-row KKT merit of the native point, then after each dual sweep or of the working candidate that reached the tolerance.
"fixed-primal-dual" when the native primal was already feasible and
complementary, "interval-joint" otherwise.
Candidate primal in the program's variables: the native primal, or a working-set point whose full-row merit reached the tolerance.
Why polishing stopped, as a sentence or a kebab-case refusal code.
Fraction of each taken step, 1 for a full step and less when blocked.
OptionaltrialMultipliers paired with trialPrimal; absent likewise.
OptionaltrialLast working-set trial primal; absent when no working step started.
Working-set changes in order, leave-wrong-sign:<row> or
enter-blocking:<row> with the original row number.
Rank of the working basis at each working solve, including refused ones.
One polishing attempt on a solved quadratic program and its diagnostics, as
polishAutoMovieQuadraticProgramreturns it inside a refinement result.Polishing takes one of two methods, chosen by whether the native primal already satisfies feasibility and complementarity on every original row: if so, it keeps that primal and sweeps the signed multipliers toward stationarity; otherwise it runs active-set steps on exact interval groups. Every step counts against the caller's one
maximumRefinementsbudget.primalanddualare only a candidate:refineAutoMovieQuadraticProgramremeasures every original row and alone setsaccepted, and a rejected candidate never replaces the native solution. Arrays are new and owned by the caller.