Abstract
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.
Funding Information
  • University Grants Commission, New Delhi, India (1213/(CSIR-UGC NET DEC 2017), PMRF ID-2703573)
  • Ministry of Education, Government of India (1213/(CSIR-UGC NET DEC 2017), PMRF ID-2703573)

This publication has 39 references indexed in Scilit: