A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem

In this article a line search algorithm is proposed for solving constrained multi-objective optimization problems. At every iteration of the proposed method, a subproblem is formulated using quadratic approximation of all functions. A feasible descent direction is obtained as a solution of this subp...

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering optimization Ročník 51; číslo 1; s. 22 - 41
Hlavní autoři:	Ansary, Md. Abu Talhamainuddin, Panda, Geetanjali
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Taylor & Francis 02.01.2019 Taylor & Francis Ltd
Témata:	Algorithms Constraints efficient solution Multi-objective optimization Multiple objective analysis Optimization Penalty function purity metric Quadratic programming Search algorithms spread metric
ISSN:	0305-215X, 1029-0273
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!