Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Maps of Finite Cardinality

This article presents nonlinear conjugate gradient methods for finding local weakly minimal points of set-valued optimization problems under a lower set less ordering relation. The set-valued objective map of the optimization problem under consideration is defined by finitely many continuously differentiable vector-valued functions. For such optimization problems, at first, we propose a general scheme for nonlinear conjugate gradient methods and then introduce Dai-Yuan, Polak-Ribière-Polyak, and Hestenes-Stiefel conjugate gradient parameters for set-valued maps. Toward deriving the general scheme, we introduce a condition of sufficient decrease and Wolfe line searches for set-valued maps. For a given sequence of descent directions of a set-valued map, it is found that if the proposed standard Wolfe line search technique is employed, then the generated sequence of iterates for set optimization follows a Zoutendijk-like condition. With the help of the derived Zoutendijk-like condition, we report that all the proposed nonlinear conjugate gradient schemes are globally convergent under usual assumptions. It is important to note that the ordering cone used in the entire study is not restricted to be finitely generated, and no regularity assumption on the solution set of the problem is required for any of the reported convergence analyses. Finally, we demonstrate the performance of the proposed methods through numerical experiments. In the numerical experiments, we demonstrate the effectiveness of the proposed methods not only on the commonly used test instances for set optimization but also on a few newly introduced problems under general ordering cones that are neither nonnegative hyper-octant nor finitely generated.