A computational comparison of some branch and bound methods for indefinite quadratic programs
type: Item
instance of: scholarly article
title: A computational comparison of some branch and bound methods for indefinite quadratic programs
zbMATH Open document ID: 1152.90550
author: Riccardo Cambini
author: Claudio Sodini
published in: CEJOR. Central European Journal of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 5320578
zbMATH Keywords: quadratic programming
zbMATH Keywords: branch and bound
zbMATH Keywords: d.c. decomposition
MaRDI profile type: Publication
full work available at URL: s10100-007-0049-4
OpenAlex ID: W2086245247
cites work: An algorithm for global minimization of linearly constrained quadratic functions
cites work: Global and local quadratic minimization
cites work: A decomposition method for global and local quadratic minimization
cites work: A finite algorithm for solving general quadratic problems
cites work: Branch-and-bound approaches to standard quadratic optimization problems
cites work: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
cites work: Decomposition methods for solving nonconvex quadratic programs via branch and bound
cites work: Q4946123
cites work: Q4352739
cites work: Q4833806
cites work: Q4697332
cites work: Q3720308
cites work: An algorithm for nonconvex programming problems
cites work: A note on the convergence of an algorithm for nonconvex programming problems
cites work: Q3997222
cites work: A new algorithm for solving the general quadratic programming problem
cites work: Maximization of A convex quadratic function under linear constraints
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: An algorithm for indefinite quadratic programming with convex constraints
cites work: Global minimization of indefinite quadratic problems
cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems
cites work: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming
cites work: Q4833805
cites work: Convex analysis and global optimization
DOI: 10.1007/S10100-007-0049-4
description: scientific article; zbMATH DE number 5320578