An efficient compact quadratic convex reformulation for general integer quadratic programs [PDF]
Computational Optimization and Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sourour Elloumi +2 more
exaly +5 more sources
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation [PDF]
Journal of Global Optimization, 2021 We propose a solution approach for the problem (P) of minimizing an unconstrained binary polynomial optimization problem. We call this method PQCR (Polynomial Quadratic Convex Reformulation). The resolution is based on a 3-phase method. The first phase consists in reformulating (P) into a quadratic program (QP).
Sourour Elloumi +2 more
exaly +6 more sources
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs [PDF]
Operations Research, 2023 Binary Quadratic Program with Variable Partitioning Constraints The binary quadratic program with variable partitioning constraints is a very general class of optimization problems that is very difficult to solve because of the nonconvexity and integrality of the variables and is ubiquitous, among others, in network design, computer vision, and ...
Andrea Lodi +2 more
exaly +4 more sources
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems [PDF]
Mathematical Programming, 2015 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 ...
Sourour Elloumi +2 more
exaly +6 more sources
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations [PDF]
RAIRO - Operations Research, 2008 Summary: Many combinatorial optimization problems can be formulated as the minimization of a 0-1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme.
Billionnet, Alain +2 more
openaire +3 more sources
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming [PDF]
SIAM Journal on Optimization, 2017 Summary: We consider in this paper a class of semicontinuous quadratic programming problems, which arises in many real-world applications such as production planning, portfolio selection, and subset selection in regression. We build upon the idea of the quadratic convex reformulation approach, i.e., adding to the original objective function an ...
Duan Li, Xiaojin Zheng, Baiyi Wu
exaly +2 more sources
Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
Journal of Industrial and Management Optimization, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojin Zheng
exaly +4 more sources
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation [PDF]
INFORMS Journal on Computing, 2017 We present algorithm MIQCR-CB that is an advancement of MIQCR. MIQCR is a method for solving mixed-integer quadratic programs and works in two phases: the first phase determines an equivalent quadratic formulation with a convex objective function by solving a semidefinite problem (SDP); in the second phase, the equivalent formulation is solved by a ...
Sourour Elloumi +2 more
exaly +4 more sources
Solving a general mixed-integer quadratic problem through convex reformulation : a computational study [PDF]
, 2010 Abstract. Let (QP) be a mixed integer quadratic program that consists of minimizing a quadratic function subject to linear constraints. In this paper, we present a convex reformulation of (QP), i.e. we reformulate (QP) into an equivalent program, with a convex objective function.
Billionnet, Alain +2 more
core +8 more sources
A convex-relaxation based method for optimal water-power flow
Energy Reports, 2022 This paper proposes a convex reformulation for the non-linear optimal water-power flow (OWPF) problem to optimize the operation cost of the integrated electricity–water network (IEWN).
Xinyi Li +4 more
doaj +1 more source