New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming

In this work, we propose a new approach called “Successive Linear Programming Algorithm (SLPA)” for finding an approximate global minimizer of general nonconvex quadratic programs. This algorithm can be initialized by any extreme point of the convex polyhedron of the feasible domain. Furthermore, we...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 82; H. 4; S. 659 - 689
Hauptverfasser:	Bentobache, Mohand, Telli, Mohamed, Mokhtari, Abdelkader
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2022 Springer Springer Nature B.V
Schlagworte:	Algorithms Computer Science Linear programming Mathematics Mathematics and Statistics Mixed integer Operations Research/Decision Theory Optimization Quadratic programming Real Functions 90C20 Local minimizer Nonconvex quadratic programming Concave quadratic programming Extreme point 90C26 90C59 Successive linear programming Global minimizer Numerical experiments Approximate global minimizer Simplex algorithm
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!