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

Saved in:
Bibliographic Details
Published in:AIMS mathematics Vol. 5; no. 6; pp. 5521 - 5540
Main Authors: Keung Lai, Kin, Kant Mishra, Shashi, Panda, Geetanjali, Abu Talhamainuddin Ansary, Md, Ram, Bhagwat
Format: Journal Article
Language:English
Published: AIMS Press 01.01.2020
Subjects:
algorithms
critical point
multiobjective
pareto optimality
q-calculus
steepest descent
ISSN:2473-6988, 2473-6988
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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