On q-steepest descent method for unconstrained multiobjective optimization problems

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...

Full description

Bibliographic Details
Main Authors: Kin Keung Lai, Shashi Kant Mishra, Geetanjali Panda, Md Abu Talhamainuddin Ansary, Bhagwat Ram
Format: Article
Language:English
Published: AIMS Press 2020-07-01
Series:AIMS Mathematics
Subjects:
multiobjective
q-calculus
steepest descent
pareto optimality
critical point
algorithms
Online Access:https://www.aimspress.com/article/10.3934/math.2020354/fulltext.html

Internet

https://www.aimspress.com/article/10.3934/math.2020354/fulltext.html

Similar Items