Linear transformation based solution methods for non-convex mixed integer quadratic programs

DOI10.1007/s11590-015-0988-yzbMath1373.90084OpenAlexW2289945873WikidataQ57931856 ScholiaQ57931856MaRDI QIDQ2359405

Eric Newby, M. Montaz Ali

Publication date: 28 June 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0988-y

zbMATH Keywords

quadratic programminglinear transformationmixed integer programmingnon-convex optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (1)

A trajectory-based method for mixed integer nonlinear programming problems

Uses Software

• BARON
• SCIP
• LINDO
• LINDOGlobal
• GloMIQO
• NEOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transformation-based preprocessing for mixed-integer quadratic programs
• GLOMIQO: global mixed-integer quadratic optimizer
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Gap inequalities for non-convex mixed-integer quadratic programs
• Extending the QCR method to general mixed-integer programs
• SCIP: solving constraint integer programs
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Gap inequalities for the cut polytope
• BARON: A general purpose global optimization software package
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• A note on convex reformulation schemes for mixed integer quadratic programs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• A trust-region-based derivative free algorithm for mixed integer programming
• The MILP Road to MIQCP
• Branching and bounds tighteningtechniques for non-convex MINLP
• The global solver in the LINDO API
• Matrix Analysis
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Linear transformation based solution methods for non-convex mixed integer quadratic programs