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

DOI10.1007/S11590-015-0988-YMaRDI QIDQ2359405zbMATH OpenOpenAlexWikidataFDO

Authors 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

linear transformationmixed integer programmingnon-convex optimizationquadratic programming

Mathematics Subject Classification ID

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

Recommendations

• Transformation-based preprocessing for mixed-integer quadratic programs
• Preprocessing for quadratic programming
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
• Advanced preprocessing techniques for linear and quadratic programming
• A note on convex reformulation schemes for mixed integer quadratic programs

Cites work

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

Cited in

(5)

• A variable transformation method for solving linear absolute-value objective-function problems with linear constraints
• Advanced preprocessing techniques for linear and quadratic programming
• A trajectory-based method for mixed integer nonlinear programming problems
• Preprocessing for quadratic programming
• Transformation-based preprocessing for mixed-integer quadratic programs

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359405)