A parametric linearizing approach for quadratically inequality constrained quadratic programs

In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated problem. To accelerate the computational speed...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Open mathematics (Warsaw, Poland) Jg. 16; H. 1; S. 407 - 419
Hauptverfasser: Jiao, Hongwei, Chen, Rongjiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Warsaw De Gruyter 01.01.2018
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Schlagworte:
65K05
90C20
90C26
Algorithms
Global optimization
Interval deleting rule
Linear programming
Parametric linearizing technique
Quadratically inequality constrained quadratic programs
ISSN:2391-5455, 2391-5455
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated problem. To accelerate the computational speed of the proposed algorithm, an interval deleting rule is used to reduce the investigated box. The proposed algorithm is convergent to the global optima of the initial problem by subsequently partitioning the initial box and solving a sequence of parametric linear programs relaxation problems. Finally, compared with some existing algorithms, numerical results show higher computational efficiency of the proposed algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2391-5455
2391-5455
DOI:10.1515/math-2018-0037