On q-steepest descent method for unconstrained multiobjective optimization problems

The q-gradient is the generalization of the gradient based on the q-derivative. The q-version of the steepest descent method for unconstrained multiobjective optimization problems is constructed and recovered to the classical one as q equals 1. In this method, the search process moves step by step f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:AIMS mathematics Ročník 5; číslo 6; s. 5521 - 5540
Hlavní autoři: Keung Lai, Kin, Kant Mishra, Shashi, Panda, Geetanjali, Abu Talhamainuddin Ansary, Md, Ram, Bhagwat
Médium: Journal Article
Jazyk:angličtina
Vydáno: AIMS Press 01.01.2020
Témata:
algorithms
critical point
multiobjective
pareto optimality
q-calculus
steepest descent
ISSN:2473-6988, 2473-6988
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!
Popis
Shrnutí:The q-gradient is the generalization of the gradient based on the q-derivative. The q-version of the steepest descent method for unconstrained multiobjective optimization problems is constructed and recovered to the classical one as q equals 1. In this method, the search process moves step by step from global at the beginning to particularly neighborhood at last. This method does not depend upon a starting point. The proposed algorithm for finding critical points is verified in the numerical examples.
ISSN:2473-6988
2473-6988
DOI:10.3934/math.2020354