Duality for nondifferentiable minimax programming in complex spaces

被引：11
|
作者：
Lai, Hang-Chin [1 ]
Liu, Jen-Chwan [2 ]
机构：
[1] Chung Yuan Christian Univ, Dept Math Appl, Chungli 32023, Taiwan
[2] Natl Taiwan Normal Univ, Dept Math Sci Precoll, Linkow, Taiwan
来源：
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS | 2009年 / 71卷 / 12期
关键词：
Complex minimax programming; Convex; Pseudoconvex; Quasiconvex; Optimality; Duality; ANALYTIC-FUNCTIONS;
D O I：
10.1016/j.na.2008.10.062
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：E224 / E233
页数：10
相关论文
共 50 条
12345