4 papers · 1 filter
New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
Cheng Lu, Yu Fei, Jing Zhou +2
It is well-known that the quadratic convex reformulation (QCR) technique can speed up some general-purpose solvers such as CPLEX and Gurobi. Recently, the method of quadratic nonco…
Variable Aggregation-based Perspective Reformulation for Mixed-Integer Convex Optimization with Symmetry
Junhao Wu, Shaoze Li, Cheng Lu +2
This paper addresses the challenging issue of symmetry in mixed-integer convex optimization problems, which frequently arise in real-world applications such as the unit commitment…
An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
Shaoze Li, Junhao Wu, Cheng Lu +2
Convex separable quadratic optimization problems occur in many practical applications. In this paper, based on an iterative resolution scheme of the KKT system, we develop an effic…
Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
Cheng Lu, Yu Fei, Gaojian Kang +4
In this paper, we consider solving nonconvex quadratic programming problems using modern solvers such as Gurobi and SCIP. It is well-known that the classical techniques of quadrati…