Second-order duality for a non-differentiable minimax programming in complex spaces

ABSTRACT

In this paper, a second-order dual problem for a non-differentiable minimax complex programming problem is formulated. The weak, strong, and strict converse duality theorems are constructed under generalized Θ-bonvexity assumptions. This means that there are no duality gaps between primary problem and its dual problem.

KEYWORDS:

• Minimax complex programming
• second-order dual problem
• Θ-bonvexity
• duality theorems
• non-differentiable

2010 AMS SUBJECT CLASSIFICATIONS:

• 90C46
• 90C47

Disclosure statement

No potential conflict of interest was reported by the author.

Additional information

Funding

This work was partly supported by Ministry of Science and Technology, Taiwan, R.O.C. [MOST 104-2115-M-035-004-].