๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Riccardo Cambini; Claudio Sodini

Publisher
Springer US
Year
2005
Tongue
English
Weight
207 KB
Volume
33
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A branch and cut algorithm for nonconvex
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
โœ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 221 KB

We present a branch and cut algorithm that yields in finite time, a globally โ˜ผ-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra