Transformation-based preprocessing for mixed-integer quadratic programs

DOI10.1007/s10957-015-0806-9zbMath1338.90276OpenAlexW2151532428WikidataQ57931865 ScholiaQ57931865MaRDI QIDQ283953

Eric Newby, M. Montaz Ali

Publication date: 17 May 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0806-9

zbMATH Keywords

quadratic programmingnon-convex optimizationmixed-integer programminglinear transformations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Linear transformations, semilinear transformations (15A04)

Related Items (2)

Linear transformation based solution methods for non-convex mixed integer quadratic programs ⋮ A trajectory-based method for mixed integer nonlinear programming problems

Uses Software

• BARON
• Matlab
• SCIP
• OPTI

Cites Work

• Matlab
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• SCIP: solving constraint integer programs
• BARON: A general purpose global optimization software package
• A note on convex reformulation schemes for mixed integer quadratic programs
• Benchmarking optimization software with performance profiles.

This page was built for publication: Transformation-based preprocessing for mixed-integer quadratic programs