Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
Abstract: In this article, we develop a trust-region technique to find critical points of unconstrained set optimization problems with the objective set-valued map defined by finitely many twice continuously differentiable functions. The technique is globally convergent and has the descent property. To ensure the descent property, a new rule of trust-region reduction ratio is introduced for the considered set-valued maps. In the derived method, to find the sequence of iteration points, we need to perform one iteration of a different vector optimization problem at each iteration. Thus, the derived technique is found to be not a straight extension of that for vector optimization. The effectiveness of the proposed algorithm is reported through performance profiles of the proposed approach with the existing methods on various test examples. A list of test problems for set optimization is also provided.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.