Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (Q4202585)

From MaRDI portal
Revision as of 00:51, 19 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60140239, #quickstatements; #temporary_batch_1708296850199)
scientific article; zbMATH DE number 404915
Language Label Description Also known as
English
Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
scientific article; zbMATH DE number 404915

    Statements

    Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 1993
    0 references
    primal-dual interior point procedure
    0 references
    convex separable quadratic objectives
    0 references
    linearly constrained convex separable nonlinear programs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references