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

DOI10.3934/JIMO.2011.7.1027MaRDI QIDQ656459zbMATHOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Extending the QCR method to general mixed-integer programs
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
• A note on solving quadratic programs using mixed-integer programming
• A reformulation-convexification approach for solving nonconvex quadratic programming problems

Cited in

(9)

• Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique.
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
• A note on solving quadratic programs using mixed-integer programming
• A note on convex reformulation schemes for mixed integer quadratic programs

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

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