Global optimization algorithm for mixed integer quadratically constrained quadratic program

DOI10.1016/j.cam.2016.12.037zbMath1366.90143OpenAlexW2572338212MaRDI QIDQ515761

San-Yang Liu, Yingfeng Zhao

Publication date: 16 March 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.12.037

zbMATH Keywords

global optimizationbranch and boundmixed integer quadratic programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (6)

General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues

Uses Software

• MINLPLib
• GloMIQO

Cites Work

• Unnamed Item
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• GLOMIQO: global mixed-integer quadratic optimizer
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Global optimality conditions and optimization methods for quadratic integer programming problems
• Constrained global optimization: algorithms and applications
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Global optimization method for linear multiplicative programming
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs

This page was built for publication: Global optimization algorithm for mixed integer quadratically constrained quadratic program