Newton's method for interval-valued multiobjective optimization problem

Abstract

In this paper, we consider a class of interval-valued multiobjective optimization problems (in short, (IVMOP)) and formulate an associated multiobjective optimization problem, referred to as (MOP). We establish that the Pareto optimal solution of the associated (MOP) is an effective solution of (IVMOP). Using this characteristic of the associated (MOP), we introduce a variant of Newton's algorithm for the considered (IVMOP). The proposed algorithm exhibits superlinear convergence to a locally effective solution of (IVMOP), provided the objective function of (IVMOP) is twice generalized Hukuhara differentiable and locally strongly convex. Furthermore, if the second-order generalized Hukuhara partial derivatives of the objective function of (IVMOP) are generalized Hukuhara Lipschitz continuous, the rate of convergence is quadratic. We provide a suitable numerical example to illustrate the developed methodology. Moreover, we employ the proposed algorithm to solve a real-life portfolio optimization problem.