A computational comparison of some branch and bound methods for indefinite quadratic programs
From MaRDI portal
Publication:940829
DOI10.1007/s10100-007-0049-4zbMath1152.90550OpenAlexW2086245247MaRDI QIDQ940829
Riccardo Cambini, Claudio Sodini
Publication date: 3 September 2008
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-007-0049-4
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items (3)
Optimal circle covering problems and their applications ⋮ Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience ⋮ Solving linear multiplicative programs via branch-and-bound: a computational experience
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-bound approaches to standard quadratic optimization problems
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Global minimization of indefinite quadratic problems
- An algorithm for indefinite quadratic programming with convex constraints
- A finite algorithm for solving general quadratic problems
- Global and local quadratic minimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- An algorithm for global minimization of linearly constrained quadratic functions
- A decomposition method for global and local quadratic minimization
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- A new algorithm for solving the general quadratic programming problem
- Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A note on the convergence of an algorithm for nonconvex programming problems
- An algorithm for nonconvex programming problems
- Maximization of A convex quadratic function under linear constraints
- Convex analysis and global optimization
This page was built for publication: A computational comparison of some branch and bound methods for indefinite quadratic programs
