An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665)

From MaRDI portal
Revision as of 13:11, 23 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An unconstrained convex programming approach to solving convex quadratic programming problems
scientific article

    Statements

    An unconstrained convex programming approach to solving convex quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    21 August 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex analysis
    0 references
    unconstrained convex programming
    0 references
    convex quadratic programming
    0 references
    \(\varepsilon\)-optimal solution
    0 references
    0 references