Answers are grounded in this paper and cite their sources.
. This paper introduces a non-monotone quasi-Newton approach for a class of set optimization problems. The proposed method aims to compute weakly minimal solutions using the lower set-less ordering approach. We consider the case in which the set-valued objective mapping is defined by a finite number of twice continuously differentiable functions. This work considers three variants of non-monotone line searches. In our proposed methods, we generate a sequence of iterates that converges to a solution satisfying the necessary optimality criteria for weakly minimal points. Finally, we discuss the numerical application of the method with the help of suitable examples.
No takes yet. Share an insight, caveat, or question.
A 2026 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: