Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

Authors:
Riccardo Cambini;Claudio Sodini
Affiliations:
Department of Statistics and Applied Mathematics, University of Pisa, Pisa, Italy 56124;Department of Statistics and Applied Mathematics, University of Pisa, Pisa, Italy 56124
Venue:
Journal of Global Optimization
Year:
2005

Citing 9
Cited 7

Global minimization of large-scale constrained concave quadratic problems by separable programming

Mathematical Programming: Series A and B
Global minimization of indefinite quadratic problems

Computing
A new algorithm for solving the general quadratic programming problem

Computational Optimization and Applications
Global and LocalQuadratic Minimization

Journal of Global Optimization
Solving a Class of Linearly Constrained Indefinite QuadraticProblems by D.C. Algorithms

Journal of Global Optimization
An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions

Journal of Global Optimization
A Decomposition Method for Global and Local Quadratic Minimization

Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

Operations Research Letters

A bilinear formulation for vector sparsity optimization

Signal Processing
A Response Surface Approach to Beam Orientation Optimization in Intensity-Modulated Radiation Therapy Treatment Planning

INFORMS Journal on Computing
A branch and reduce approach for solving a class of low rank d.c. programs

Journal of Computational and Applied Mathematics
Locating Objects in the Plane Using Global Optimization Techniques

Mathematics of Operations Research
Properties of two DC algorithms in quadratic programming

Journal of Global Optimization
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience

Operations Research Letters
GloMIQO: Global mixed-integer quadratic optimizer

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to suggest branch and bound schemes, based on a relaxation of the objective function, to solve nonconvex quadratic programs over a compact polyhedral feasible region. The various schemes are based on different d.c. decomposition methods applied to the quadratic objective function. To improve the tightness of the relaxations, we also suggest solving the relaxed problems with an algorithm based on the so called "optimal level solutions" parametrical approach.