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...
详细信息
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.
The paper contains a version of a minimax theorem with weakened convexity, extending a minimax theorem of Fan. The main result is obtained with the use of a generalized Gordan theorem, which is proved using a separati...
详细信息
The paper contains a version of a minimax theorem with weakened convexity, extending a minimax theorem of Fan. The main result is obtained with the use of a generalized Gordan theorem, which is proved using a separation theorem. An example is also discussed.
暂无评论