Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems

DOI10.3934/jimo.2011.7.1027zbMath1231.90317OpenAlexW2333472555WikidataQ57434633 ScholiaQ57434633MaRDI QIDQ656459

Ye Tian, Cheng Lu

Publication date: 18 January 2012

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.1027

zbMATH Keywords

equivalenceconic reformulationpractical algorithmsecond order sufficient global optimality condition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique ⋮ Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems

This page was built for publication: Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems