Hestenes–Stiefel-Type Conjugate Direction Algorithm for Interval-Valued Multiobjective Optimization Problems
Open Access
- 23 June 2025
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 18 (7) , 381
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.Keywords
All Related Versions
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:
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentialsAnnals of Operations Research, 2025
- On conjugate direction-type method for interval-valued multiobjective quadratic optimization problemsNumerical Algorithms, 2024
- A projected hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods with application to nonnegative matrix factorizationJournal of Applied Mathematics and Computing, 2024
- Generalized-Hukuhara-Gradient Efficient-Direction Method to Solve Optimization Problems with Interval-Valued Functions and Its Application in Least-Squares ProblemsInternational Journal of Fuzzy Systems, 2021
- Multi-objective enhanced interval optimization problemAnnals of Operations Research, 2020
- Efficient solution of interval optimization problemMathematical Methods of Operations Research, 2012
- Subgradient Method for Convex Feasibility on Riemannian ManifoldsJournal of Optimization Theory and Applications, 2011
- Steepest descent methods for multicriteria optimizationMathematical Methods of Operations Research, 2000
- Multiobjective programming in optimization of the interval objective functionEuropean Journal of Operational Research, 1990
- A conjugate direction algorithm without line searchesJournal of Optimization Theory and Applications, 1977