Largest |y · (a·x − endpoint)| over the rows, using the endpoint the
multiplier's sign selects, |y| when that endpoint is unbounded, and 0
for an equality row.
Returned multipliers in original row order, positive on an active upper endpoint and negative on an active lower endpoint.
Largest endpoint violation over all original rows, in row units.
The single native solve the refinement started from.
OptionalpolishingThe polishing attempt; absent when the native status is not 1, the budget is 0, or the native solution already passed admission.
Returned primal, one value per program variable.
Copy of the native primal, kept even when a polished one is returned.
Polishing steps taken; 0 when polishing did not run.
Original row numbers of each group of identical coefficient rows.
Infinity norm of H·x + q + Aᵀ·y, with every original row in A.
Native status, unchanged by polishing; 1 is Solved.
The solution
refineAutoMovieQuadraticProgramreturns for a diagonal quadratic program, with its residuals measured on every original row.primalanddualare the native solution unless polishing produced a finite candidate that passed the caller's threshold on every original row; then they are that candidate.statusis always the native status, so an unsuccessful solve is never promoted. The caller admits the solution only whenstatusis 1 and the three residuals are within its tolerance. All arrays are new and owned by the caller.