A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems

DOI10.1080/02331934.2017.1391253zbMath1398.90115OpenAlexW2766089206MaRDI QIDQ4639134

Shu-Cherng Fang, Cheng Lu, Xiao-ling Guo, Zhi-bin Deng

Publication date: 3 May 2018

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2017.1391253

zbMATH Keywords

branch-and-cut algorithmsemidefinite relaxationnonconvex quadratically constrained quadratic programmingpolar cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) 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

• GloptiPoly
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• On zero duality gap in nonconvex quadratic programming problems
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• 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
• Test examples for nonlinear programming codes
• Primal-dual methods for vertex and facet enumeration
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• On convex relaxations for quadratically constrained quadratic programming
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• Finding largest small polygons with gloptipoly
• \(NP\)-hardness of linear multiplicative programming and related problems
• Lectures on Modern Convex Optimization
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• The MILP Road to MIQCP
• GloptiPoly 3: moments, optimization and semidefinite programming
• Global optimality conditions for mixed nonconvex quadratic programs†
• The Homotopy Principle and Algorithms for Linear Programming
• A set of geometric programming test problems and their solutions
• Disjunctive Programming
• Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
• Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
• Portfolio selection with marginal risk control
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

This page was built for publication: A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems