𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A global minimization algorithm for nonconvex all-quadratic programming problems

✍ Scribed by Reeves, Gary R

Book ID
123592393
Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
52 KB
Volume
3
Category
Article
ISSN
0305-0483

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