A successive linear approximation algorithm for the global minimization of a concave quadratic program

In this work, we propose an algorithm for finding an approximate global minimum of a concave quadratic function with a negative semi-definite matrix, subject to linear equality and inequality constraints, where the variables are bounded with finite or infinite bounds. The proposed algorithm starts w...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational & applied mathematics Ročník 39; číslo 4
Hlavní autori:	Telli, Mohamed, Bentobache, Mohand, Mokhtari, Abdelkader
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.12.2020 Springer Nature B.V
Predmet:	Algorithms Applications of Mathematics Applied physics Approximation Computational mathematics Computational Mathematics and Numerical Analysis Linear programming Mathematical Applications in Computer Science Mathematical Applications in the Physical Sciences Mathematics Mathematics and Statistics Matrix methods Quadratic equations 90C20 Global optimization Concave quadratic programming Level curve Linear programming 90C26 90C59 Numerical experiments Approximation sets
ISSN:	2238-3603, 1807-0302
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!