A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199)

From MaRDI portal
scientific article
In more languages
Configure
Language Label Description Also known as
English
A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
scientific article

    Statements

    A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (English)
    12 November 2021
    second order cone programming relaxation
    semidefinite programming relaxation
    nonconvex quadratic program
    branch-and-bound algorithm
    difference of convex decomposition

    Identifiers