Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches

DOI10.1023/B:COAP.0000026886.61324.e4zbMath1056.90112OpenAlexW2066349366MaRDI QIDQ1876594

Immanuel M. Bomze, Marco Locatelli

Publication date: 20 August 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000026886.61324.e4

zbMATH Keywords

global optimizationsemidefinite programmingbranch-and-boundquadratic optimizationmatrix pencil

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (10)

A model for clustering data from heterogeneous dissimilarities ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ On global optimization with indefinite quadratics ⋮ 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 ⋮ Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ DC decomposition of nonconvex polynomials with algebraic techniques ⋮ A difference of convex formulation of value-at-risk constrained optimization

This page was built for publication: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches