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ženo v:

Podrobná bibliografie
Vydáno v:	Computational & applied mathematics Ročník 39; číslo 4
Hlavní autoři:	Telli, Mohamed, Bentobache, Mohand, Mokhtari, Abdelkader
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.12.2020 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!