Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-015-0921-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Semidefinite, Conic and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essays and Surveys in Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Reformulations of Integer Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the QCR method to general mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization in nonlinear optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization. From theory to implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-015-0921-2 / rank
 
Normal rank

Latest revision as of 13:57, 9 December 2024

scientific article
Language Label Description Also known as
English
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
scientific article

    Statements

    Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2016
    0 references
    This article considers the general mixed integer, quadratically constrained problem in combinatorial optimization and proposes a novel reformulation of the problem into an equivalent quadratic problem with a convex continuous relaxation. The article begins with an overview of the literature and the mathematical formulation of the problem, followed by the presentation of a family of equivalent formulations. This is followed by a method for calculating the best convex equivalent formulation which is then used to find the optimal solution to the problem. The fourth and fifth sections present an extension of the method to the case of equality constraints and the case where some of the variables are continuous, respectively. A large number of computational results are presented where the method is applied to numerous quadratic problems and the performance of the approach is evaluated.
    0 references
    integer quadratic programming
    0 references
    equivalent convex reformulation
    0 references
    semidefinite programming
    0 references
    branch-and-bound algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers