Local minimizer of a nonconvex quadratic programming problem (Q2639602)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Local minimizer of a nonconvex quadratic programming problem
scientific article

    Statements

    Local minimizer of a nonconvex quadratic programming problem (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    This is a version without all proofs of a paper in czech by the author (Solving a nonconvex quadratic programming problem; Sbornik PF C. Budejovice 1980, 67-83). The paper presents a modification of Beale's algorithm for nonconvex quadratic programming that may converge only to a local minimizer. Also, cycling is avoided.
    0 references
    0 references
    reduced gradient
    0 references
    Beale's algorithm
    0 references
    nonconvex quadratic programming
    0 references
    local minimizer
    0 references
    cycling
    0 references
    0 references
    0 references