Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654)

From MaRDI portal
Revision as of 19:48, 29 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7722198
Language Label Description Also known as
English
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
scientific article; zbMATH DE number 7722198

    Statements

    Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2023
    0 references
    separable nonconvex quadratic program
    0 references
    Lagrangian breakpoint search
    0 references
    successive convex optimization
    0 references
    convex relaxation
    0 references
    branch-and-bound
    0 references

    Identifiers