2000 character limit reached
Optimality conditions at infinity for nonsmooth minimax programming (2405.09869v1)
Published 16 May 2024 in math.OC
Abstract: This paper is devoted to study of optimality conditions at infinity in nonsmooth minimax programming problems and applications. By means of the limiting subdifferential and normal cone at infinity, we dirive necessary and sufficient optimality conditions of Karush--Kuhn--Tucker type for nonsmooth minimax programming problems with constraint. The obtained results are applied to a nonsmooth vector optimization problem.