scientific article; zbMATH DE number 7152114
From MaRDI portal
Publication:5208413
Recommendations
- Quadratic convex reformulations for quadratic 0-1 programming
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Quadratic convex reformulations for semicontinuous quadratic programming
- Convex quadratic programming approach
- On convex relaxations for quadratically constrained quadratic programming
- Quasi-convex programming revisited
- On quadratic and complete quadratic problems of convex programming
- A linear programming reformulation of the standard quadratic optimization problem
- A new convex relaxation for quadratically constrained quadratic programming
Cited in
(7)- Dantzig-Wolfe reformulations for binary quadratic problems
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Exact optimization: Part I
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Remarks on solutions to a nonconvex quadratic programming test problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208413)
