Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions (Q896726)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions |
scientific article |
Statements
Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions (English)
0 references
11 December 2015
0 references
Summary: We start our discussion with a class of nondifferentiable minimax programming problems in complex space and establish sufficient optimality conditions under generalized convexity assumptions. Furthermore, we derive weak, strong, and strict converse duality theorems for the two types of dual models in order to prove that the primal and dual problems will have no duality gap under the framework of generalized convexity for complex functions.
0 references
0 references
0 references
0 references
0 references
0 references
0 references