Branch-and-bound approaches to standard quadratic optimization problems
From MaRDI portal
Publication:598585
DOI10.1023/A:1013886408463zbMath1045.90042OpenAlexW1517044116MaRDI QIDQ598585
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013886408463
Related Items
Computable representations for convex hulls of low-dimensional quadratic forms, On convex relaxations for quadratically constrained quadratic programming, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Performance comparison of two recently proposed copositivity tests, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, The fundamental theorem of linear programming: extensions and applications, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, A computational comparison of some branch and bound methods for indefinite quadratic programs, A new branch-and-bound algorithm for standard quadratic programming problems, Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems, A study on sequential minimal optimization methods for standard quadratic problems, D.C. versus copositive bounds for standard QP
Uses Software
