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

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

โœ Scribed by Kurt M. Anstreicher

Publisher
Springer US
Year
2008
Tongue
English
Weight
464 KB
Volume
43
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

The bounds of feasible space on constrai
The bounds of feasible space on constrained nonconvex quadratic programming
โœ Jinghao Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 135 KB

This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmings. Results show that one may compute a bound of the radius of the feasible space by a linear programming which is known to be a P -problem [N. Karmarkar,