Dual bounds and optimality cuts for all-quadratic programs with convex constraints (Q5929999)

From MaRDI portal
scientific article; zbMATH DE number 1587231
Language Label Description Also known as
English
Dual bounds and optimality cuts for all-quadratic programs with convex constraints
scientific article; zbMATH DE number 1587231

    Statements

    Dual bounds and optimality cuts for all-quadratic programs with convex constraints (English)
    0 references
    0 references
    8 November 2001
    0 references
    For the all-quadratic optimization problem with convex constraints optimality cuts are introduced which cut off a given local minimizer from the feasible set. A branch-and-bound algorithm is proposed that uses optimality cuts which are finite if all global minimizers satisfy a certain second order condition. The optimality cuts are based on a dual problem with additional redundant conditions. This technique is also used to derive tight lower bounds as well as to construct dual bounds for certain problems with zero duality gap.
    0 references
    global optimization
    0 references
    all-quadratic optimization
    0 references
    branch-and-bound algorithm
    0 references
    optimality cuts
    0 references
    duality gap
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references