Optimality conditions and penalty function method for nonsmooth optimization problems with interval-valued objective functions
Year: 2026
Type: article
Abstract: In this paper, a class of nonconvex nonsmooth optimization problems is characterized with interval-valued objective functions with equality and inequality constraints. We establish the E -Karush-Kuhn-Tucker (E-KKT) necessary optimality conditions for such problems under the assumption of E -subdifferentiability. Also, sufficient optimality conditions are derived by employing appropriate notions of E -subconvexity. Further, we propose and analyze a l 1 exact E -penalty function approach for solving constrained nondifferentiable optimization problems involving interval-valued objective functions. The exactness property of the proposed E -penalty function is thoroughly investigated in the E -subconvex case. Precise conditions are provided under which the set of πΏ β’ π β πΈ -optimal solutions to the original interval-valued problem coincides exactly with the set of optimal solutions to the corresponding penalized problem. Furthermore, an implementable algorithm based on the minimization of the l 1 exact E -penalty function is developed, together with a rigorous convergence analysis.
Authors: Najeeb Abdulaleem, Ivan Matychyn
Institution: University of Warmia and Mazury in Olsztyn
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,710
OpenAlex ID: W7208835231
