Duality for nondifferentiable minimax programming in complex spaces Original Research Article

Employing the optimality (necessary and sufficient) conditions of a nondifferentiable minimax programming problem in complex spaces, we formulate a one-parametric dual and a parameter free dual problems. On both dual problems, we establish three duality theorems: weak, strong, and strict converse duality theorem, and prove that there is no duality gap between the two dual problems with respect to the primal problem under some generalized convexities of complex functions in the complex programming problem.