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

DOI10.1023/B:COAP.0000026886.61324.E4MaRDI QIDQ1876594zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundglobal optimizationmatrix pencilquadratic optimizationsemidefinite programming

Mathematics Subject Classification ID

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

Recommendations

• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A computational comparison of some branch and bound methods for indefinite quadratic programs
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• A branch and bound algorithm for solving a class of D-C programming

Cited in

(13)

• On global optimization with indefinite quadratics
• DC decomposition of nonconvex polynomials with algebraic techniques
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• A model for clustering data from heterogeneous dissimilarities
• A difference of convex formulation of value-at-risk constrained optimization
• Testing copositivity with the help of difference-of-convex optimization
• Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search
• The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• A computational comparison of some branch and bound methods for indefinite quadratic programs

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

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