Hestenes–Stiefel-Type Conjugate Direction Algorithm for Interval-Valued Multiobjective Optimization Problems

This article investigates a class of interval-valued multiobjective optimization problems (IVMOPs). We define the Hestenes–Stiefel (HS)-type direction for the objective function of IVMOPs and establish that it has a descent property at noncritical points. An Armijo-like line search is employed to de...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms Vol. 18; no. 7; p. 381
Main Authors: Pandey, Rupesh Krishna, Upadhyay, Balendu Bhooshan, Poddar, Subham, Stancu-Minasian, Ioan
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.07.2025
Subjects:
ISSN:1999-4893, 1999-4893
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article investigates a class of interval-valued multiobjective optimization problems (IVMOPs). We define the Hestenes–Stiefel (HS)-type direction for the objective function of IVMOPs and establish that it has a descent property at noncritical points. An Armijo-like line search is employed to determine an appropriate step size. We present an HS-type conjugate direction algorithm for IVMOPs and establish the convergence of the sequence generated by the algorithm. We deduce that the proposed algorithm exhibits a linear order of convergence under appropriate assumptions. Moreover, we investigate the worst-case complexity of the sequence generated by the proposed algorithm. Furthermore, we furnish several numerical examples, including a large-scale IVMOP, to demonstrate the effectiveness of our proposed algorithm and solve them by employing MATLAB. To the best of our knowledge, the HS-type conjugate direction method has not yet been explored for the class of IVMOPs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a18070381