AutoMovie API
    Preparing search index...

    Borrowed program minimizing 0.5*sum(diagonal[i]*x[i]^2)+sum(linear[i]*x[i]) under inclusive sparse row bounds. Coefficient units follow the caller's variable, objective and row units; no geometric conversion occurs.

    admitAutoMovieQuadraticProgram requires 1..2^31-1 variables and at most 2^31-1 rows, complete aligned vectors, nonnegative diagonal, unique resident row indices, ordered bounds and finite scalars with magnitude below 1e30. Container shape and allocatable aggregate storage remain caller/host premises. Admission does not establish feasibility or convergence.

    type IInput = {
        diagonal: readonly number[];
        initial?: readonly number[];
        linear: readonly number[];
        rows: readonly IAutoMovieQuadraticRow[];
    }
    Index
    diagonal: readonly number[]

    Nonnegative diagonal P of the objective, one coefficient per variable; zero is allowed.

    initial?: readonly number[]

    Optional complete variable vector admitted like linear. The current kernel ignores it and starts cold; omission never reuses a previous solution.

    linear: readonly number[]

    Linear q coefficients with the same variable order and length as diagonal.

    rows: readonly IAutoMovieQuadraticRow[]

    Inclusive sparse bounds on A*x in caller-defined row units; an empty list means no row constraints.