In this paper, a class of optimization problems with cone constraints in groups and semigroups is investigated by exploiting the image space analysis. Optimality is proved by means of separation arguments in the image space associated with the given problem, which turns out to be equivalent to the existence of saddle points of generalized Lagrangian functions under suitable assumptions. In particular, Lagrangian-type sufficient or necessary optimality conditions are obtained by introducing convex-like functions and using separation theorems between convex sets in groups and semigroups obtained by Li and Mastroeni.
Optimization Problems with Cone Constraints in Groups and Semigroups: An Approach Based on Image Space Analysis
Mastroeni G.
2023-01-01
Abstract
In this paper, a class of optimization problems with cone constraints in groups and semigroups is investigated by exploiting the image space analysis. Optimality is proved by means of separation arguments in the image space associated with the given problem, which turns out to be equivalent to the existence of saddle points of generalized Lagrangian functions under suitable assumptions. In particular, Lagrangian-type sufficient or necessary optimality conditions are obtained by introducing convex-like functions and using separation theorems between convex sets in groups and semigroups obtained by Li and Mastroeni.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
