Journal of Nonlinear and Variational Analysis

Full Text: PDF
DOI: 10.23952/jnva.7.2023.5.08

Volume 7, Issue 5, 1 October 2023, Pages 785-809

 

Abstract. In this paper, we develop Newton’s method for robust counterpart of an uncertain multiobjective optimization problem under an arbitrary finite uncertainty nonempty set. Here the robust counterpart of an uncertain multiobjective optimization problem is the minimum of objective wise worst case, which is the nonsmooth deterministic multiobjective optimization problem. To solve this robust counterpart with the help of Newton’s method, a suproblem is constructed and solved to find a descent direction for robust counterpart. An Armijo type inexact line search technique is developed to find a suitable step length. With the help of the descent direction and step length, we present the Newton’s algorithm for the robust counterpart. The convergence of the Newton’s algorithm for the robust counterpart is obtained under some usual assumptions. We also prove that the algorithm converges with super linear and quadratic rate under different assumptions. Finally, we verify the algorithm and compare with the weighted sum method via some numerical problems.

 

How to Cite this Article:
S. Kumar, M.A.T. Ansary, N.K. Mahato, D. Ghosh, Y. Shehu, Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets, J. Nonlinear Var. Anal. 7 (2023), 785-809.