A polyhedral study of nonconvex quadratic programs with box constraints

DOI10.1007/s10107-004-0549-0zbMath1137.90009OpenAlexW2029423538MaRDI QIDQ1774169

Dieter Vandenbussche, Nemhauser, George I.

Publication date: 29 April 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0549-0

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Global solutions to folded concave penalized nonconvex learning, Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, A note on sufficient global optimality conditions for fixed charge quadratic programs, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Global optimality conditions for fixed charge quadratic programs, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Skyport location problem for urban air mobility system, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, (Global) optimization: historical notes and recent developments, Separation and relaxation for cones of quadratic forms, A branch-and-bound algorithm for instrumental variable quantile regression, Using general triangle inequalities within quadratic convex reformulation method, Domain reduction techniques for global NLP and MINLP optimization, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Global optimization for non-convex programs via convex proximal point method, An LPCC approach to nonconvex quadratic programs, On linear programs with linear complementarity constraints, Outlier detection and least trimmed squares approximation using semi-definite programming, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Box-constrained quadratic programs with fixed charge variables, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Convexification Techniques for Linear Complementarity Constraints, Semidefinite program duals for separable polynomial programs involving box constraints, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Relaxing the optimality conditions of box QP, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, A binarisation heuristic for non-convex quadratic programming with box constraints, Convexification techniques for linear complementarity constraints, CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS

Cites Work