Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

DOI10.1007/s10898-017-0591-0zbMath1417.90111OpenAlexW2794009555WikidataQ130194614 ScholiaQ130194614MaRDI QIDQ1753128

Yutong Pan, Xueting Cui, Xiao Jin Zheng

Publication date: 25 May 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0591-0

zbMATH Keywords

global optimizationsemidefinite programmingquadratic convex reformulationbinary QCQP

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (1)

A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Extending the QCR method to general mixed-integer programs
• Facility location models for distribution system design
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• Quadratic maximization and semidefinite relaxation
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
• A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• The MILP Road to MIQCP
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• New Results on Quadratic Minimization
• Semidefinite Programming
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

This page was built for publication: Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint